Since both rules have the same neighborhood size, then a sequence of cells maps to a single state applying the inverse evolution rule , but the same sequence has ancestors with the evolution rule . In this way we have that a sequence of has ancestors which share a unique common central cell, as is presented in Figure 4 .
This is extensible for sequences of states with a length greater than , a long sequence can be taken as successive overlaps of sequences with length . Therefore we have that for , a sequence of length has ancestors, each one of them with cells, where the ancestors share a common sequence with length ; this is showed in Figure 5.
Take a sequence of cells, this sequence has ancestors of length cells, and these ancestors have a common central sequence with cells, as we can see in Figure 6.
The same behavior exists for the inverse evolution rule but in inverse direction and with inverted values of its Welch indices. That is, the index in the inverse evolution rule has the same value that the index in the original evolution rule , and the index in has the same value that the index in . With the construction in Figure 6, we can define sets and , where the elements of are sequences of length cells and the left ancestor sequences of each one of them, also of length cells. This is analogous for constructing the elements of set .
Thus, the set has as many elements as and the set has as many elements as . We now define two sets, and , such that the cardinality of is and the cardinality of the set is . Then, there exists a bijection both from the set to the set , and from the set to the set . In this way, we can define two block permutations and .
The permutation goes from the set of sequences with length cells to all the possible sequences with the form , where and , for and . The second permutation is almost analogous, it goes from the set of sequences with length cells to the set of all the possible sequences with the form . With these permutations, we can represent the evolution of a reversible one dimensional cellular automaton as the composition of two block permutations and a shift of length cells between both permutations.
|
We shall use these block permutations in reversible one dimensional cellular automata to analyze the dynamical behavior of these systems. The following section establishes the basic concepts of dynamical system theory that we use in this study.