Author： Bedon N.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.156, Iss.1, 1996-03, pp. : 119-144
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. :
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. :
Learning Fallible Deterministic Finite Automata
By Ron D.
Machine Learning, Vol. 18, Iss. 2-3, 1995-02 ,pp. :
Minimal cover-automata for finite languages
By Campeanu C. Santean N. Yu S.
Theoretical Computer Science, Vol. 267, Iss. 1, 2001-09 ,pp. :