Dynamical behavior of additive cellular automata over finite abelian groups
From MaRDI portal
(Redirected from Publication:2003993)
Recommendations
- Ergodicity, transitivity, and regularity for linear cellular automata over \(\mathbb{Z}_m\)
- On ergodic linear cellular automata over \(\mathbf{Z}_m\)
- On the ergodic properties of certain additive cellular automata over \(\mathbb Z_{m}\)
- scientific article; zbMATH DE number 1163209
- On the dynamical behavior of chaotic cellular automata
Cites work
- scientific article; zbMATH DE number 5291271 (Why is no real title available?)
- scientific article; zbMATH DE number 3745547 (Why is no real title available?)
- scientific article; zbMATH DE number 44378 (Why is no real title available?)
- scientific article; zbMATH DE number 2042127 (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?)
- A Full Cellular Automaton to Simulate Predator-Prey Systems
- A complete and efficiently computable topological classification of D-dimensional linear cellular automata over \(Z_{m}\)
- Algebraic properties of linear cellular automata
- Chaos and ergodicity are decidable for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\)
- Characterizing asymptotic randomization in abelian cellular automata
- Computing issues of asynchronous CA
- Conservation of some dynamical properties for operations on cellular automata
- Decidability of sensitivity and equicontinuity for linear higher-order cellular automata
- Dynamical properties of expansive one-sided cellular automata
- Endomorphisms and automorphisms of the shift dynamical system
- Ergodic endomorphisms of compact Abelian groups
- Ergodic theory on compact spaces
- Ergodicity, transitivity, and regularity for linear cellular automata over \(\mathbb{Z}_m\)
- From one-dimensional to two-dimensional cellular automata
- Homogeneity of surjective cellular automata
- Languages, equicontinuity and attractors in cellular automata
- Linear cellular automata over \(Z_ m\)
- Local rule distributions, language complexity and non-uniform cellular automata
- Lyapunov exponent versus expansivity and sensitivity in cellular automata
- Mathematical Foundations of Computer Science 2004
- Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues
- Non-uniform Cellular Automata
- Non-uniform cellular automata: classes, dynamics, and decidability
- Number conserving cellular automata. II: Dynamics.
- Number-conserving cellular automata I: Decidability.
- On computing the entropy of cellular automata.
- On the directional dynamics of additive cellular automata
- On the hierarchy of conservation laws in a cellular automaton
- Periodic orbits and dynamical complexity in cellular automata
- Periodic points for onto cellular automata
- Pre-expansivity in cellular automata
- Revisiting the Rice theorem of cellular automata
- Rice's theorem for the limit sets of cellular automata
- Sensitive dependence on initial conditions
- Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
- Solution of some conjectures about topological properties of linear cellular automata
- Some properties of cellular automata with equicontinuity points
- Surjective linear cellular automata over \({\mathbb{Z}}_{m}\)
- Textile systems for endomorphisms and automorphisms of the shift
- The Nilpotency Problem of One-Dimensional Cellular Automata
- The fractal structure of cellular automata on abelian groups
- Three research directions in non-uniform cellular automata
- Transitive Cellular Automata are Sensitive
Cited in
(9)- Dynamical properties of a cellular automaton on a countable group
- An efficiently computable characterization of stability and instability for linear cellular automata
- 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
- Chaos and ergodicity are decidable for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\)
- Easy to check algebraic characterizations of dynamical properties for linear CA and additive CA over a finite abelian group
- Decidable characterizations of dynamical properties for additive cellular automata over a finite abelian group with applications to data encryption
- On the ergodic properties of certain additive cellular automata over \(\mathbb Z_{m}\)
- 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: Dynamical behavior of additive cellular automata over finite abelian groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2003993)
