Transitive Cellular Automata are Sensitive
From MaRDI portal
Publication:4891809
Cited in
(17)- Decidability and undecidability in cellular automata
- A survey on transitivity in discrete time dynamical systems. application to symbolic systems and related languages
- Additive one-dimensional cellular automata are chaotic according to Devaney's definition of chaos
- Dynamical behavior of additive cellular automata over finite abelian groups
- Conservation of some dynamical properties for operations on cellular automata
- On the dynamical behavior of chaotic cellular automata
- Generalized sub-shifts in elementary cellular automata: The ``strange case of chaotic rule 180
- Combinatorial constructions associated to the dynamics of one-sided cellular automata.
- Additive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic Properties
- Statistical mechanics of surjective cellular automata
- A survey of cellular automata: types, dynamics, non-uniformity and applications
- On ergodic linear cellular automata over \(\mathbf{Z}_m\)
- Ergodicity, transitivity, and regularity for linear cellular automata over \(\mathbb{Z}_m\)
- Chaos emerged on the `edge of chaos'
- Investigating topological chaos by elementary cellular automata dynamics
- A family of sand automata
- On one-sided, D-chaotic CA without fixed points, having continuum of periodic points with period 2 topological entropy \(\log(p)\) for any prime \(p\)
This page was built for publication: Transitive Cellular Automata are Sensitive
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4891809)