Author： Domosi P. Nehaniv C.L. Rhodes J.L.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.302, Iss.1, 2003-06, pp. : 295-317
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
By BASU SUMITA
Cybernetics and Systems, Vol. 36, Iss. 2, 2005-03 ,pp. :
Access to resources
Recommend
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. :
Finite acceptance of infinite words
Theoretical Computer Science, Vol. 174, Iss. 1, 1997-03 ,pp. :
On the combinatorics of finite words
By de Luca A.
Theoretical Computer Science, Vol. 218, Iss. 1, 1999-04 ,pp. :