Transitive behavior in reversible one-dimensional cellular automata with a Welch index 1

Abstract

The problem of knowing and characterizing the transitive behavior of a given cellular automaton is a very interesting topic. This paper provides a matrix representation of the global dynamics in reversible one-dimensional cellular automata with a Welch index 1, i.e. those where the ancestors differ just at one end. We prove that the transitive closure of this matrix shows diverse types of transitive behaviors in these systems. Part of the theorems in this paper are reductions of well-known results in symbolic dynamics. This matrix and its transitive closure were computationally implemented, and some examples are presented.