We present the basic properties of reversible one-dimensional cellular automata equivalent by permutations with the full shift, this work only takes reversible automata of neighborhood size 2. In these cases, we prove that the evolution rule defining the temporal behavior of the automaton may specify the spacial behavior as well. Based on this result we present a procedure for constructing configurations with a predefined dynamical behavior. Some examples of these results are presented
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.