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.
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
![[Snapshot]](HTMLImages/index.en/thumbnail_1.gif)
![[Snapshot]](HTMLImages/index.en/thumbnail_2.gif)
![[Snapshot]](HTMLImages/index.en/thumbnail_3.gif)
![[Snapshot]](HTMLImages/index.en/thumbnail_4.gif)
![[Snapshot]](HTMLImages/index.en/thumbnail_5.gif)
![[Snapshot]](HTMLImages/index.en/thumbnail_6.gif)
Embed Interactive Demonstration 
Browse all topics
