Author： Champarnaud J.-M.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.267, Iss.1, 2001-09, pp. : 17-34
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
On the Computational Complexity of P Automata
By Csuhaj-Varjú Erzsébet Ibarra Oscar Vaszil György
Natural Computing, Vol. 5, Iss. 2, 2006-05 ,pp. :
Access to resources
Recommend
Kolmogorov complexity and cellular automata classification
By Dubacq J.-C. Durand B. Formenti E.
Theoretical Computer Science, Vol. 259, Iss. 1, 2001-05 ,pp. :
A construction on finite automata that has remained hidden
Theoretical Computer Science, Vol. 204, Iss. 1, 1998-09 ,pp. :