arXiv · 1503.05999
On the Bernoulli Automorphism of Reversible Linear Cellular Automata
Abstract
This investigation studies the ergodic properties of reversible linear cellular automata over $\mathbb{Z}_m$ for $m \in \mathbb{N}$. We show that a reversible linear cellular automaton is either a Bernoulli automorphism or non-ergodic. This gives an affirmative answer to an open problem proposed in [Pivato, Ergodc theory of cellular automata, Encyclopedia of Complexity and Systems Science, 2009, pp.~2980-3015] for the case of reversible linear cellular automata.
Explore related subjects
Keep this discovery
Chih-Hung Chang, Huilan Chang. 2015-03-20. On the Bernoulli Automorphism of Reversible Linear Cellular Automata. https://doi.org/10.1016/j.ins.2016.01.062
Cite the original work for its findings. Save a collection to share your selection of sources.