Author： Durand B. Formenti E. Roka Z.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.299, Iss.1, 2003-04, pp. : 523-535
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
Universality and decidability of number-conserving cellular automata
By Moreira A.
Theoretical Computer Science, Vol. 292, Iss. 3, 2003-01 ,pp. :
Access to resources
Recommend
Number conserving cellular automata II: dynamics
Theoretical Computer Science, Vol. 304, Iss. 1, 2003-07 ,pp. :
Decidability of equivalence for deterministic synchronized tree automata
By Salomaa K.
Theoretical Computer Science, Vol. 167, Iss. 1, 1996-10 ,pp. :
Program schemata vs. automata for decidability of program logics
By Shilov N.V.
Theoretical Computer Science, Vol. 175, Iss. 1, 1997-03 ,pp. :
A simulation of cellular automata on hexagons by cellular automata on rings
By Martin B.
Theoretical Computer Science, Vol. 263, Iss. 1, 2001-07 ,pp. :