Cellular Automaton State Transition Diagrams
Requires a Wolfram Notebook System
Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.
Each vertex on the graph represents one of the states of a size- elementary cellular automaton, and is joined to the vertex representing the state reached after one step in the cellular automaton evolution.
Contributed by: Stephen Wolfram (March 2011)
Open content licensed under CC BY-NC-SA
A system of limited size has a behavior that is ultimately repetitive. The maximum possible repetition period for any system is always equal to the total number of possible states of the system. Of the elementary rules, only rule 45 seems to yield periods that always stay close to the maximum of