Author： Campeanu C. Santean N. Yu S.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.267, Iss.1, 2001-09, pp. : 3-16
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Efficient implementation of regular languages using reversed alternating finite automata
By Salomaa K. Wu X. Yu S.
Theoretical Computer Science, Vol. 231, Iss. 1, 2000-01 ,pp. :
Access to resources
Recommend
By BASU SUMITA
Cybernetics and Systems, Vol. 36, Iss. 2, 2005-03 ,pp. :
Finite automata on timed -trees
Theoretical Computer Science, Vol. 293, Iss. 3, 2003-02 ,pp. :
By Bedon N.
Theoretical Computer Science, Vol. 156, Iss. 1, 1996-03 ,pp. :