Surjective cellular automata with zero entropy are almost one-to-one
From MaRDI portal
Publication:634916
DOI10.1016/J.CHAOS.2011.01.013zbMath1243.37012OpenAlexW2017606799MaRDI QIDQ634916
Publication date: 17 August 2011
Published in: Chaos, Solitons and Fractals (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.chaos.2011.01.013
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Homogeneity of surjective cellular automata
- Topological and measure-theoretic properties of one-dimensional cellular automata
- On computing the entropy of cellular automata.
- On ergodic one-dimensional cellular automata
- Applications of almost one-to-one maps
- Cellular automata and Lyapunov exponents
- Measure rigidity for algebraic bipermutative cellular automata
- Endomorphisms and automorphisms of the shift dynamical system
This page was built for publication: Surjective cellular automata with zero entropy are almost one-to-one