Undecidability of CA classification schemes
Complex Systems
On the limit sets of cellular automata
SIAM Journal on Computing
Rice's theorem for the limit sets of cellular automata
Theoretical Computer Science
Models of massive parallelism: analysis of cellular automata and neural networks
Models of massive parallelism: analysis of cellular automata and neural networks
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
Invertible linear cellular automata over Zm: algorithmic and dynamical aspects
Journal of Computer and System Sciences
Ergodicity, transitivity, and regularity for linear cellular automata over Zm1
Theoretical Computer Science
Investigating topological chaos by elementary cellular automata dynamics
Theoretical Computer Science
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
On Computing the Entropy of Cellular Automata
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
On Ergodic Linear Cellular Automata over Zm
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Attractors of D-dimensional Linear Cellular Automata
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Decidable Properties of 2D Cellular Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues
Theoretical Computer Science
| Hi-index | 0.00 |
We study two dynamical properties of linear D-dimensional cellular automata over Zm namely, denseness of periodic points and topological mixing. For what concerns denseness of periodic points, we complete the work initiated in [9], [3], and [2] by proving that a linear cellular automata has dense periodic points over the entire space of configurations if and only if it is surjective (as conjectured in [2]). For nonsurjective linear CA we give a complete characterization of the subspace where periodic points are dense. For what concerns topological mixing, we prove that this property is equivalent to transitivity and then easily checkable. Finally, we claissify linear cellular automata according to the definition of chaos given by Devaney in [8].