Swapping Rule and Initial Condition
The upper plots show a pair of cellular automaton evolutions. The bits of the rule for the first evolution are chosen as the period for the initial condition of the second evolution and vice versa. Instead of taking bits of an ordinary enumeration, this Demonstration uses their Gray coded bits. The third array plot shows the difference of the two evolutions modulo two.