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

10Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.
Get full text

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, expansive, strongly transitive, and equicontinuous.

Cite

CITATION STYLE

APA

Manzini, G., & Margara, L. (1997). A complete and efficiently computable topological classification of D-dimensional linear cellular automata over Zm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1256, pp. 794–804). Springer Verlag. https://doi.org/10.1007/3-540-63165-8_232

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free