Variations on State Transition Diagrams of Elementary Cellular Automata

Initializing live version
Download to Desktop

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

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.

Contributed by: Daniel de Souza Carvalho (March 2011)
Open content licensed under CC BY-NC-SA




Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.