navbar-top.gif
btn_spacer.gifHomeTopicsLatestRandomAboutFAQsParticipateAuthoring Areabtn_spacer.gif

Cellular Automaton State Transition Diagrams
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


"Cellular Automaton State Transition Diagrams" from The Wolfram Demonstrations Project
 http://demonstrations.wolfram.com/CellularAutomatonStateTransitionDiagrams/
Contributed by: Stephen Wolfram
Free Download: Mathematica Player--Runs all Demonstrations & more
Related Topics

Some Related Demonstrations

Share & Bookmark This Demonstration

Contribute
Powered by Wolfram Mathematica
Give us your feedback
Give us your feedback

Source page:




 often  occasionally  never

Note: Please do not include anything you consider confidential or proprietary. We will keep your information private. We will not give it to any third party.
Privacy Policy »
©  2008 The Wolfram Demonstrations Project & Contributors    Wolfram Research    Site Index    Terms of Use    Privacy Policy    RSS    Atom