Dynamical behavior of additive cellular automata over finite abelian groups
From MaRDI portal
Publication:2003993
DOI10.1016/j.tcs.2020.06.021zbMath1464.37021OpenAlexW3035973969MaRDI QIDQ2003993
Darij Grinberg, Enrico Formenti, Alberto Dennunzio, Luciano Margara
Publication date: 13 October 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2020.06.021
Related Items (6)
Chaos and ergodicity are decidable for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\) ⋮ Decidable characterizations of dynamical properties for additive cellular automata over a finite abelian group with applications to data encryption ⋮ Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over \(\mathbb{Z}_p\) ⋮ Effective Projections on Group Shifts to Decide Properties of Group Cellular Automata ⋮ An efficient algorithm deciding chaos for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\) with applications to data encryption ⋮ An efficiently computable characterization of stability and instability for linear cellular automata
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- On the directional dynamics of additive cellular automata
- Linear cellular automata over \(Z_ m\)
- Ergodic endomorphisms of compact Abelian groups
- Surjective linear cellular automata over \({\mathbb{Z}}_{m}\)
- Algebraic properties of linear cellular automata
- Ergodic theory on compact spaces
- Lyapunov exponent versus expansivity and sensitivity in cellular automata
- Rice's theorem for the limit sets of cellular automata
- Dynamical properties of expansive one-sided 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\)
- Some properties of cellular automata with equicontinuity points
- 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
- A complete and efficiently computable topological classification of D-dimensional linear cellular automata over \(Z_{m}\)
- Decidability of sensitivity and equicontinuity for linear higher-order cellular automata
- Pre-expansivity in cellular automata
- Chaos and ergodicity are decidable for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\)
- 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
- Sensitive dependence on initial conditions
- Languages, equicontinuity and attractors in cellular automata
- Textile systems for endomorphisms and automorphisms of the shift
- Transitive Cellular Automata are Sensitive
- Computing Issues of Asynchronous CA
- Characterizing asymptotic randomization in abelian cellular automata
- Mathematical Foundations of Computer Science 2004
- Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
- Endomorphisms and automorphisms of the shift dynamical system
This page was built for publication: Dynamical behavior of additive cellular automata over finite abelian groups
