Ergodicity, transitivity, and regularity for linear cellular automata over Z_m
From MaRDI portal
Publication:1575952
Recommendations
- On ergodic linear cellular automata over \(\mathbf{Z}_m\)
- On the ergodic properties of certain additive cellular automata over \(\mathbb Z_{m}\)
- A complete and efficiently computable topological classification of D-dimensional linear cellular automata over Z m
- A complete and efficiently computable topological classification of D-dimensional linear cellular automata over \(Z_{m}\)
- Ergodic characterization of linear cellular automata over \(Z_{m}\)
Cites work
- Additive one-dimensional cellular automata are chaotic according to Devaney's definition of chaos
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- Dynamical characteristics of linear cellular automata
- Endomorphisms and automorphisms of the shift dynamical system
- Ergodic endomorphisms of compact Abelian groups
- Ergodicity of linear cellular automata over \({\mathbb Z}_{m}\)
- Exact results for deterministic cellular automata with additive rules
- scientific article; zbMATH DE number 4138816 (Why is no real title available?)
- scientific article; zbMATH DE number 4074492 (Why is no real title available?)
- scientific article; zbMATH DE number 44378 (Why is no real title available?)
- Linear cellular automata over \(Z_ m\)
- On ergodic one-dimensional cellular automata
- On the ergodic theory of cellular automata
- On the Limit Sets of Cellular Automata
- Periodic orbits for additive cellular automata
- Rice's theorem for the limit sets of cellular automata
- Transitive Cellular Automata are Sensitive
Cited in
(28)- On the directional dynamics of additive cellular automata
- Ergodic characterization of linear cellular automata over \(Z_{m}\)
- On the dynamical behavior of chaotic cellular automata
- Attractors of linear cellular automata
- On computing the entropy of cellular automata.
- On the Bernoulli automorphism of reversible linear cellular automata
- Theory of cellular automata: a survey
- Solution of some conjectures about topological properties of linear cellular automata
- A complete and efficiently computable topological classification of D-dimensional linear cellular automata over \(Z_{m}\)
- Dynamical behavior of additive cellular automata over finite abelian groups
- On the dynamical behaviour of linear higher-order cellular automata and its decidability
- An efficiently computable characterization of stability and instability for linear cellular automata
- The measure-theoretic entropy and topological entropy of actions over \(\mathbb{Z}_m\)
- On the ergodic properties of certain additive cellular automata over \(\mathbb Z_{m}\)
- Chaos and ergodicity are decidable for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\)
- Decidability and undecidability in cellular automata
- Embedding Bratteli–Vershik systems in cellular automata
- A family of sand automata
- scientific article; zbMATH DE number 1418340 (Why is no real title available?)
- On ergodic linear cellular automata over \(\mathbf{Z}_m\)
- Additive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic Properties
- Mathematical Foundations of Computer Science 2003
- Classifying 1D elementary cellular automata with the 0-1 test for chaos
- The impact of alphabet size on pattern complexity of maxmin- cellular automata
- Easy to check algebraic characterizations of dynamical properties for linear CA and additive CA over a finite abelian group
- From linear to additive cellular automata
- A divide and conquer algorithm for deciding group cellular automata dynamics
- The topological pressure of linear cellular automata
This page was built for publication: Ergodicity, transitivity, and regularity for linear cellular automata over \(\mathbb{Z}_m\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1575952)
