Author： Neven F. Schwentick T.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.275, Iss.1, 2002-03, pp. : 633-674
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
Finite automata on timed -trees
Theoretical Computer Science, Vol. 293, Iss. 3, 2003-02 ,pp. :
Access to resources
Recommend
By BASU SUMITA
Cybernetics and Systems, Vol. 36, Iss. 2, 2005-03 ,pp. :
By Bedon N.
Theoretical Computer Science, Vol. 156, Iss. 1, 1996-03 ,pp. :
Theoretical Computer Science, Vol. 300, Iss. 1, 2003-05 ,pp. :
On viewing block codes as finite automata
By Shankar P. Dasgupta A. Deshmukh K. Rajan B.S.
Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. :