We study the dynamical behavior of D-dimensional linear cellular automata over Z(m). We provide easy-to-check necessary and sufficient conditions for a D-dimensional linear cellular automata over Z(m) 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 Z(m) according to the most important dynamical properties studied in the theory of discrete time dynamical systems. (C) 1999 Published by Elsevier Science B.V. All rights reserved.
A complete and efficiently computable topological classification of D-dimensional linear cellular automata over Zm / Manzini G.; Margara L.. - In: THEORETICAL COMPUTER SCIENCE. - ISSN 0304-3975. - STAMPA. - 221:1-2(1999), pp. 157-177. [10.1016/S0304-3975(99)00031-6]
A complete and efficiently computable topological classification of D-dimensional linear cellular automata over Zm
Margara L.
1999
Abstract
We study the dynamical behavior of D-dimensional linear cellular automata over Z(m). We provide easy-to-check necessary and sufficient conditions for a D-dimensional linear cellular automata over Z(m) 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 Z(m) according to the most important dynamical properties studied in the theory of discrete time dynamical systems. (C) 1999 Published by Elsevier Science B.V. All rights reserved.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
