Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars

Author： Lee J.   Imai K.   Morita K.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.304, Iss.1, 2003-07, pp. : 185-200

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Reversible simulation of one-dimensional irreversible cellular automata

By Morita K.  

Theoretical Computer Science, Vol. 148, Iss. 1, 1995-08 ,pp. : 157-163

Elsevier

Access to resources Recommend Favorite

Signals in one-dimensional cellular automata

By Mazoyer J.   Terrier V.  

Theoretical Computer Science, Vol. 217, Iss. 1, 1999-03 ,pp. : 53-80

Elsevier

Access to resources Recommend Favorite

Additive one-dimensional cellular automata are chaotic according to Devaney's definition of chaos

By Favati P.   Lotti G.   Margara L.  

Theoretical Computer Science, Vol. 174, Iss. 1, 1997-03 ,pp. : 157-170

Elsevier

Access to resources Recommend Favorite

Automaticity of double sequences generated by one-dimensional linear cellular automata

By Allouche J.-P.   von Haeseler F.   Peitgen H.-O.   Petersen A.   Skordev G.  

Theoretical Computer Science, Vol. 188, Iss. 1, 1997-11 ,pp. : 195-209

Elsevier

Access to resources Recommend Favorite

Parallel turing machines with one-head control units and cellular automata

By Worsch T.  

Theoretical Computer Science, Vol. 217, Iss. 1, 1999-03 ,pp. : 3-30

Elsevier

Access to resources Recommend Favorite