Mathematica MathWorld Wolfram Science More »

HOME

TOPICS

LATEST

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.


	Contributed by: Stephen Wolfram

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

State Networks for Systems of Limited Size (NKS|Online)

Systems of Limited Size and Class 2 Behavior (NKS|Online)

"Cellular Automaton State Transition Diagrams" from The Wolfram Demonstrations Project
http://demonstrations.wolfram.com/CellularAutomatonStateTransitionDiagrams/

Contributed by: Stephen Wolfram

Report an issue »

Interact with Demonstrations using the latest version of the free Mathematica Player—Download Now

Browse all topics

	Source page:
	Email	Name (optional)
	Occupation (optional)	Organization (optional)
	I use Mathematica often occasionally never
	Country (optional) Remember me
	Note: Please do not include anything you consider confidential or proprietary. Your message and contact information may be shared with the author of any specific Demonstration for which you give feedback, but will not otherwise be published or distributed. Privacy Policy »

Wolfram Research

Site Index

RSS

Atom