BUILT-IN MATHEMATICA SYMBOL

# CellularAutomaton

CellularAutomaton[rule, init, t]
generates a list representing the evolution of the cellular automaton with the specified rule from initial condition init for t steps.

CellularAutomaton[rule, init]
gives the result of evolving init for one step.

CellularAutomaton[rule, init, {tspec, xspec, ...}]
gives only those parts of the evolution specified by tspec, xspec, etc.

CellularAutomaton[rule, init, {t, All, ...}]
includes at each step all cells that could be affected over the course of t steps.

## DetailsDetails

• Possible forms for rule are:
•  n , , elementary rule with rule number n {n,k} general nearest-neighbor rule with k colors {n,k,r} general rule with k colors and range r {n,k,{r1,r2,...,rd}} d-dimensional rule with neighborhood {n,k,{{off1},{off2},...,{offs}}} rule with neighbors at specified offsets {n,k,rspec,s} order-s rule {n,{k,1}} k-color nearest-neighbor totalistic rule {n,{k,1},r} k-color range-r totalistic rule {n,{k,{wt1,wt2,...}},rspec} rule in which neighbor i is assigned weight {lhs1->rhs1,lhs2->rhs2,...} explicit replacements for lists of neighbors {fun,{},rspec} general function f to apply to each list of neighbors bfun Boolean function to apply to collections of neighbors
• CellularAutomaton[{n, k}, ...] is equivalent to CellularAutomaton[{n, {k, {k^2, k, 1}}}, ...].
• Common forms for 2D cellular automata include:
•  {n,{k,1},{1,1}} 9-neighbor totalistic rule {n,{k,{{0,1,0},{1,1,1},{0,1,0}}},{1,1}} 5-neighbor totalistic rule {n,{k,{{0,k,0},{k,1,k},{0,k,0}}},{1,1}} 5-neighbor outer totalistic rule
• The number of possible cellular automaton rules is as follows:
•  elementary rules 256 1D general rules 1D totalistic rules 2D general rules 2D 9-neighbor totalistic rules 2D 5-neighbor totalistic rules 2D 5-neighbor outer totalistic rules
• Normally, all elements in init and the evolution list are integers between 0 and .
• When a general function or replacement list is used, the elements of init and the evolution list can be any expressions. »
• Explicit replacement rules can contain patterns.
• In a 1D cellular automaton, replacement rules or an explicit function fun are always taken to apply to a 1D list of neighbors. If the neighbors are specified by explicit offsets, they are given in the order of the offsets.
• When the neighborhood in a multidimensional cellular automaton is defined by a range specification such as , the list of neighbors is taken to be a full array with dimensions .
• If the neighbors in a multidimensional cellular automaton are specified by an explicit list of offsets, the neighbors are supplied in a one-dimensional list in the order of the offsets.
• If an explicit function fun is given, the first argument supplied to it is the list of neighbors. The second argument is the step number starting at 0.
• A complete rule specification is considered to be a pure Boolean function bfun if BooleanVariables[bfun] yields an integer v. In this case, bfun is applied to neighborhoods of v cells at each step. The neighborhoods extend Ceiling[v/2] cells to the left.
• In an order-s cellular automaton, specified by , each step depends on s preceding steps.
• Initial conditions are constructed from init as follows:
•  {a1,a2,...} explicit list of values , assumed cyclic {{a1,a2,...},b} values superimposed on a b background {{a1,a2,...},{b1,b2,...}} values superimposed on a background of repetitions of , , ... {{{{a11,a12,...},off1}, {{a21,...},off2},...},bspec} values at offsets on a background {{a11,a12,...},{a21,...},...} explicit list of values in two dimensions {aspec,bspec} values in d dimensions with d-dimensional padding
• The first element of aspec is superimposed on the background at the first position in the positive direction in each coordinate relative to the origin. This means that is aligned with .
• CellularAutomaton[rule, init, t] generates an evolution list of length .
• For an order-s cellular automaton, init is a list giving the initial s steps in the evolution of the system.
• Time specifications tspec in can be as follows:
•  t all steps 0 through t {t} a list containing only step t {{t}} step t alone {t1,t2} steps through {t1,t2,dt} steps , , ...
• The initial condition is considered to be at step 0.
• CellularAutomaton[rule, init, {tspec}] uses the default Automatic for xspec.
• Space specifications xspec can be as follows:
•  All all cells that can be affected by the specified initial condition Automatic all cells in the region that differs from the background 0 cell aligned with beginning of aspec x cells at offsets up to x on the right -x cells at offsets up to x on the left {x} cell at offset x to the right {-x} cell at offset x to the left {x1,x2} cells at offsets through {x1,x2,dx} cells , , ...
• In one dimension, the first element of aspec is taken by default to have space offset 0.
• In any number of dimensions, is taken by default to have space offset .
• Each element of the evolution list produced by CellularAutomaton is always the same size.
• With an initial condition specified by an aspec of width , the region that can be affected after steps by a cellular automaton with a rule of range has width .
• If no bspec background is specified, space offsets of All and Automatic will include every cell in aspec.
• A space offset of All includes all cells that can be affected by the initial condition.
• A space offset of Automatic can be used to trim off background from the sides of a cellular automaton pattern.
• In working out how wide a region to keep, Automatic only looks at results on steps specified by .
• CellularAutomaton[rule][init] is equivalent to CellularAutomaton[rule, init].

## ExamplesExamplesopen allclose all

### Basic Examples (2)Basic Examples (2)

Run rule 30 for 2 steps:

 Out[1]=

Run for 50 steps from a single 1 on a background of 0s:

 Out[1]=