Undecidability of CA classification schemes
Complex Systems
Group structured linear cellular automata over Zm
Journal of Computer and System Sciences
Additive one-dimensional cellular automata are chaotic according to Devaney's definition of chaos
Theoretical Computer Science
Ergodicity of linear cellular automata over Zm
Information Processing Letters
Lyapunov exponents versus expansivity and sensitivity in cellular automata
Journal of Complexity
Theoretical Computer Science
Ergodicity, transitivity, and regularity for linear cellular automata over Zm1
Theoretical Computer Science
Attractors of linear cellular automata
Journal of Computer and System Sciences
Characterization of Sensitive Linear Cellular Automata with Respect to the Counting Distance
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
On Computing the Entropy of Cellular Automata
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Hi-index | 0.00 |
Cellular automata(CA) is not only a discrete dynamical system with infinite dimensions, but also an important computational model. How simple can a CA be and yet support interesting and complicated behavior. There are many unsolved problems in the theory of CA, which appeal many researchers to focus their attentions on the field, especially subclass of CA – linear CA. These studies cover the topological properties, chaotical properties, invertibility, attractors and the classification of linear CA etc.. This is a survey of known results and open questions of D-dimensional linear CA over ℤm.