Author： Giammarresi D. Montalbano R.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.215, Iss.1, 1999-02, pp. : 191-208
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
Learning Fallible Deterministic Finite Automata
By Ron D.
Machine Learning, Vol. 18, Iss. 2-3, 1995-02 ,pp. :
Access to resources
Recommend
Two-dimensional cellular automata and deterministic on-line tessalation automata
By Terrier V.
Theoretical Computer Science, Vol. 301, Iss. 1, 2003-05 ,pp. :
Decidability of equivalence for deterministic synchronized tree automata
By Salomaa K.
Theoretical Computer Science, Vol. 167, Iss. 1, 1996-10 ,pp. :
On the representation of finite deterministic 2-tape automata
By Pelletier M. Sakarovitch J.
Theoretical Computer Science, Vol. 225, Iss. 1, 1999-08 ,pp. :