Abstract
Purchase PDF (962 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (9)
Purchase PDF (390 K)
doi:10.1016/S0304-3975(99)00031-6 
Copyright © 1999 Published by Elsevier Science B.V.
Contribution
A complete and efficiently computable topological classification of D-dimensional linear cellular automata over Zm*1
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Available online 13 August 1999.
Abstract
We study the dynamical behavior of D-dimensional linear cellular automata over Zm. We provide easy-to-check necessary and sufficient conditions for a D-dimensional linear cellular automata over Zm to be sensitive to initial conditions, positively expansive, strongly transitive, and equicontinuous. As a consequence of our results, we have a complete and efficiently computable topological classification of D-dimensional linear cellular automata over Zm according to the most important dynamical properties studied in the theory of discrete time dynamical systems.
Author Keywords: Linear cellular automata; Topological properties; Discrete time dynamical systems
Article Outline
Corresponding author. Departimento de Scienze e Tectnol. Avanzante, Universita di Torino, , Torino, , Italy.
*1 A preliminary version of this paper has been presented to the 24th International Colloquium on Automata Languages and Programming (ICALP '97).
