It is possible to study the dynamics and complexity of cellular automaton (CA) evolution by state transition diagrams, in which each node represents a state of the system, and two nodes are connected when one state produces the other in a single step of the evolution. This Demonstration considers a slight generalization of state transition diagrams, where each row is mapped to a number by taking its mean, total, or decimal representation. Each CA is begun from a finite random initial condition.