Ergodicity, transitivity, and regularity for linear cellular automata over \(\mathbb{Z}_m\)
From MaRDI portal
Publication:1575952
DOI10.1016/S0304-3975(98)00005-XzbMath0953.37002OpenAlexW2009486992MaRDI QIDQ1575952
Enrico Formenti, Giovanni Manzini, Luciano Margara, Gianpiero Cattaneo
Publication date: 23 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00005-x
Ergodicity, mixing, rates of mixing (37A25) Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15)
Related Items (19)
Solution of some conjectures about topological properties of linear cellular automata ⋮ The topological pressure of linear cellular automata ⋮ On the Bernoulli automorphism of reversible linear cellular automata ⋮ Chaos and ergodicity are decidable for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\) ⋮ Classifying 1D elementary cellular automata with the 0-1 test for chaos ⋮ On computing the entropy of cellular automata. ⋮ The impact of alphabet size on pattern complexity of maxmin-\( \omega\) cellular automata ⋮ On the dynamical behaviour of linear higher-order cellular automata and its decidability ⋮ A complete and efficiently computable topological classification of D-dimensional linear cellular automata over \(Z_{m}\) ⋮ A family of sand automata ⋮ An efficiently computable characterization of stability and instability for linear cellular automata ⋮ Dynamical behavior of additive cellular automata over finite abelian groups ⋮ Theory of cellular automata: a survey ⋮ Additive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic Properties ⋮ On the directional dynamics of additive cellular automata ⋮ On the dynamical behavior of chaotic cellular automata ⋮ The measure-theoretic entropy and topological entropy of actions over \(\mathbb{Z}_m\) ⋮ Attractors of linear cellular automata ⋮ Decidability and undecidability in cellular automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear cellular automata over \(Z_ m\)
- Periodic orbits for additive cellular automata
- Dynamical characteristics of linear cellular automata
- Exact results for deterministic cellular automata with additive rules
- Ergodic endomorphisms of compact Abelian groups
- Additive one-dimensional cellular automata are chaotic according to Devaney's definition of chaos
- Rice's theorem for the limit sets of cellular automata
- Ergodicity of linear cellular automata over \({\mathbb Z}_{m}\)
- On ergodic one-dimensional cellular automata
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- On the Limit Sets of Cellular Automata
- On the ergodic theory of cellular automata
- Transitive Cellular Automata are Sensitive
- Endomorphisms and automorphisms of the shift dynamical system
This page was built for publication: Ergodicity, transitivity, and regularity for linear cellular automata over \(\mathbb{Z}_m\)
