States from All Possible Elementary Cellular Automata

step

100

initial condition

include non-quiescent rules

Look at row t in the pattern produced by each of the 255 elementary cellular automata. Now arrange all the resulting rows in lexicographic order. The result is the picture generated here. Vertical stripes reveal "popular" states, generated by many different cellular automaton rules.