An efficiently computable characterization of stability and instability for linear cellular automata
From MaRDI portal
Publication:2229949
DOI10.1016/J.JCSS.2021.06.001OpenAlexW3174077669MaRDI QIDQ2229949FDOQ2229949
Authors: Alberto Dennunzio, Enrico Formenti, Darij Grinberg, 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
Recommendations
- Easy to check algebraic characterizations of dynamical properties for linear CA and additive CA over a finite abelian group
- Dynamical characteristics of linear cellular automata
- A complete and efficiently computable topological classification of D-dimensional linear cellular automata over \(Z_{m}\)
- Chaos and ergodicity are decidable for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\)
- A complete and efficiently computable topological classification of D-dimensional linear cellular automata over Z m
Cites Work
- Title not available (Why is that?)
- Solution of some conjectures about topological properties of linear cellular automata
- Local rule distributions, language complexity and non-uniform cellular automata
- Non-uniform cellular automata: classes, dynamics, and decidability
- Representation theory of finite monoids
- A complete and efficiently computable topological classification of D-dimensional linear cellular automata over \(Z_{m}\)
- Title not available (Why is that?)
- Rice's theorem for the limit sets of cellular automata
- Three research directions in non-uniform cellular automata
- Linear cellular automata over \(Z_ m\)
- Ergodicity, transitivity, and regularity for linear cellular automata over \(\mathbb{Z}_m\)
- Mathematical Foundations of Computer Science 2004
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Revisiting the Rice theorem of cellular automata
- Attractors of linear cellular automata
- Algebraic properties of linear cellular automata
- Dynamical behavior of additive cellular automata over finite abelian groups
- On the dynamical behaviour of linear higher-order cellular automata and its decidability
- (Mostly) Commutative Algebra
- Decidable characterizations of dynamical properties for additive cellular automata over a finite abelian group with applications to data encryption
Cited In (5)
- Title not available (Why is that?)
- Easy to check algebraic characterizations of dynamical properties for linear CA and additive CA over a finite abelian group
- Identification of Periodic Boundary SACA Rules Exploring NSRT Diagram
- Title not available (Why is that?)
- Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over \(\mathbb{Z}_p\)
This page was built for publication: An efficiently computable characterization of stability and instability for linear cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2229949)
