A complete and efficiently computable topological classification of D-dimensional linear cellular automata over Z m

Author： Manzini G.   Margara L.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.221, Iss.1, 1999-06, pp. : 157-177

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

Ergodicity, transitivity, and regularity for linear cellular automata over Z m

By Cattaneo G.   Formenti E.   Manzini G.   Margara L.  

Theoretical Computer Science, Vol. 233, Iss. 1, 2000-02 ,pp. : 147-164

Elsevier

Access to resources Recommend Favorite

Ergodic characterization of linear cellular automata over Z m

By Sato T.  

Theoretical Computer Science, Vol. 205, Iss. 1, 1998-08 ,pp. : 135-144

Elsevier

Access to resources Recommend Favorite

Invertible Linear Cellular Automata over Zm : Algorithmic and Dynamical Aspects

By Manzini G.   Margara L.  

Journal of Computer and System Sciences, Vol. 56, Iss. 1, 1998-02 ,pp. : 60-67

Academic Press

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

A Random NP-complete problem for inversion of 2D cellular automata

By Durand B.  

Theoretical Computer Science, Vol. 148, Iss. 1, 1995-08 ,pp. : 19-32

Elsevier

Access to resources Recommend Favorite