Chaos and ergodicity are decidable for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\)
From MaRDI portal
Publication:2666860
DOI10.1016/j.ins.2020.05.123zbMath1483.37022OpenAlexW3033765620MaRDI QIDQ2666860
Alberto Dennunzio, Enrico Formenti, Darij Grinberg, Luciano Margara
Publication date: 23 November 2021
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2020.05.123
Ergodicity, mixing, rates of mixing (37A25) Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15)
Related Items
Random expansion method for the generation of complex cellular automata, Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over \(\mathbb{Z}_p\), Asynchronous communicating cellular automata: formalization, robustness and equivalence, An efficient algorithm deciding chaos for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\) with applications to data encryption, Dynamical behavior of additive cellular automata over finite abelian groups
Cites Work
- 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
- 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
- Algebraic properties of linear cellular automata
- Ergodicity, transitivity, and regularity for linear cellular automata over \(\mathbb{Z}_m\)
- 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
- A polynomial approach to linear algebra
- A secret sharing scheme based on cellular automata
- A Full Cellular Automaton to Simulate Predator-Prey Systems
- SOME BASIC CRYPTOGRAPHIC REQUIREMENTS FOR CHAOS-BASED CRYPTOSYSTEMS
- Algebra
- Computing Issues of Asynchronous CA
- Additive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic Properties
