Additive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic Properties
From MaRDI portal
Publication:5092431
DOI10.4230/LIPIcs.MFCS.2019.68OpenAlexW2971132693MaRDI QIDQ5092431
Alberto Dennunzio, Luciano Margara, Darij Grinberg, Enrico Formenti
Publication date: 21 July 2022
Full work available at URL: https://hal.science/hal-02268122
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues
- Local rule distributions, language complexity and non-uniform cellular automata
- Three research directions in non-uniform cellular automata
- Homogeneity of surjective cellular automata
- Periodic points for onto cellular automata
- Non-uniform cellular automata: classes, dynamics, and decidability
- Conservation of some dynamical properties for operations on cellular automata
- Ancestors, descendants, and gardens of Eden in reaction systems
- Computational complexity of dynamical systems: the case of cellular automata
- Linear cellular automata over \(Z_ m\)
- Ergodic endomorphisms of compact Abelian groups
- Algebraic properties of linear cellular automata
- Ergodic theory on compact spaces
- Lyapunov exponent versus expansivity and sensitivity in cellular automata
- Attractors of linear cellular automata
- Reversibility and surjectivity problems of cellular automata
- Rice's theorem for the limit sets of cellular automata
- On computing the entropy of cellular automata.
- Number conserving cellular automata. II: Dynamics.
- Ergodicity, transitivity, and regularity for linear cellular automata over \(\mathbb{Z}_m\)
- On the hierarchy of conservation laws in a cellular automaton
- Number-conserving cellular automata I: Decidability.
- Solution of some conjectures about topological properties of linear cellular automata
- Surjective multidimensional cellular automata are non-wandering: a combinatorial proof
- A complete and efficiently computable topological classification of D-dimensional linear cellular automata over \(Z_{m}\)
- On the dynamical behaviour of linear higher-order cellular automata and its decidability
- Computation and logic in the real world. Third conference on computability in Europe, CiE 2007, Siena, Italy, June 18--23, 2007. Proceedings.
- Revisiting the Rice Theorem of Cellular Automata
- A Full Cellular Automaton to Simulate Predator-Prey Systems
- Non-uniform Cellular Automata
- The Nilpotency Problem of One-Dimensional Cellular Automata
- Transitive Cellular Automata are Sensitive
- Computing Issues of Asynchronous CA
- Mathematical Foundations of Computer Science 2004
- Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
- Shifting and Lifting of Cellular Automata
- Endomorphisms and automorphisms of the shift dynamical system
