An efficiently computable characterization of stability and instability for linear cellular automata
From MaRDI portal
Publication:2229949
DOI10.1016/j.jcss.2021.06.001OpenAlexW3174077669MaRDI QIDQ2229949
Enrico Formenti, Darij Grinberg, Alberto Dennunzio, Luciano Margara
Publication date: 17 September 2021
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2021.06.001
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Representation theory of finite monoids
- 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
- Linear cellular automata over \(Z_ m\)
- Algebraic properties of linear cellular automata
- Attractors of linear cellular automata
- Rice's theorem for the limit sets of 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
- On the dynamical behaviour of linear higher-order cellular automata and its decidability
- Revisiting the Rice Theorem of Cellular Automata
- Mathematical Foundations of Computer Science 2004
- (Mostly) Commutative Algebra
- Decidable characterizations of dynamical properties for additive cellular automata over a finite abelian group with applications to data encryption
