Expansivity, Permutivity, and Chaos for Cellular Automata

@article{Fagnani1998ExpansivityPA,
  title={Expansivity, Permutivity, and Chaos for Cellular Automata},
  author={F. Fagnani and Luciano Margara},
  journal={Theory of Computing Systems},
  year={1998},
  volume={31},
  pages={663-677}
}
We study the dynamics of expansive cellular automata. We prove that a cellular automaton is expansive if and only if it is topologically conjugate to an appropriate one-sided subshift. We define a large class of expansive cellular automata in terms of the permutivity of the local rule on which they are based. We prove that each cellular automaton of this class is topologically conjugate to a one-sided full shift. Since one-sided full shifts are widely recognized as the paradigm of chaotic… CONTINUE READING