From linear to additive cellular automata
From MaRDI portal
Cites work
- A complete and efficiently computable topological classification of D-dimensional linear cellular automata over \(Z_{m}\)
- A Full Cellular Automaton to Simulate Predator-Prey Systems
- Additive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic Properties
- Algebraic properties of linear cellular automata
- Attractors of linear cellular automata
- Conservation of some dynamical properties for operations on cellular automata
- Dynamical behavior of additive cellular automata over finite abelian groups
- Ergodicity, transitivity, and regularity for linear cellular automata over \(\mathbb{Z}_m\)
- From one-dimensional to two-dimensional cellular automata
- scientific article; zbMATH DE number 5291271 (Why is no real title available?)
- scientific article; zbMATH DE number 2046045 (Why is no real title available?)
- scientific article; zbMATH DE number 1500511 (Why is no real title available?)
- scientific article; zbMATH DE number 1886322 (Why is no real title available?)
- scientific article; zbMATH DE number 852845 (Why is no real title available?)
- scientific article; zbMATH DE number 3205673 (Why is no real title available?)
- Languages, equicontinuity and attractors in cellular automata
- Linear cellular automata over \(Z_ m\)
- Local rule distributions, language complexity and non-uniform cellular automata
- Mathematical Foundations of Computer Science 2004
- Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues
- Non-uniform cellular automata: classes, dynamics, and decidability
- Number conserving cellular automata. II: Dynamics.
- Number-conserving cellular automata I: Decidability.
- On the directional dynamics of additive cellular automata
- On the dynamical behaviour of linear higher-order cellular automata and its decidability
- On the hierarchy of conservation laws in a cellular automaton
- Periodic orbits and dynamical complexity in cellular automata
- Revisiting the Rice theorem of cellular automata
- Rice's theorem for the limit sets of cellular automata
- Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
- Solution of some conjectures about topological properties of linear cellular automata
- Three research directions in non-uniform cellular automata
This page was built for publication: From linear to additive cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6842445)
