# Cellular Automata

Cellular automata provide a convenient way to represent many kinds of systems in which the values of cells in an array are updated in discrete steps according to a local rule.

Generating a cellular automaton evolution.

This starts with the list given, then evolves rule 30 for four steps.

Out[1]= | |

This shows 100 steps of rule 30 evolution from random initial conditions.

Out[2]= | |

This starts with the list given, then evolves rule 30 for four steps.

Out[3]= | |

{a_{1},a_{2},...} | explicit list of values |

{{a_{1},a_{2},...},b} | values superimposed on a b background |

{{a_{1},a_{2},...},blist} | values superimposed on a background of repetitions of blist |

{{{{a_{11},a_{12},...},{d_{1}}},...},blist} | values at offsets |

Ways of specifying initial conditions for one-dimensional cellular automata.

If you give an explicit list of initial values,

CellularAutomaton will take the elements in this list to correspond to all the cells in the system, arranged cyclically.

The right neighbor of the cell at the end is the cell at the beginning.

Out[4]= | |

It is often convenient to set up initial conditions in which there is a small "seed" region, superimposed on a constant "background". By default,

CellularAutomaton automatically fills in enough background to cover the size of the pattern that can be produced in the number of steps of evolution you specify.

This shows rule 30 evolving from an initial condition containing a single black cell.

Out[5]= | |

This shows rule 30 evolving from an initial condition consisting of a

seed on a background of repeated

blocks.

Out[6]= | |

Particularly in studying interactions between structures, you may sometimes want to specify initial conditions for cellular automata in which certain blocks are placed at particular offsets.

This sets up an initial condition with black cells at offsets

.

Out[7]= | |

n | , , elementary rule |

{n,k} | general nearest-neighbor rule with k colors |

{n,k,r} | general rule with k colors and range r |

{n,{k,1}} | k-color nearest-neighbor totalistic rule |

{n,{k,1},r} | k-color range r totalistic rule |

{n,{k,{wt_{1},wt_{2},...}},r} | rule in which neighbor i is assigned weight |

{n,kspec,{{off_{1}},{off_{2}},...,{off_{s}}}} | rule with neighbors at specified offsets |

{lhs_{1}->rhs_{1},lhs_{2}->rhs_{2},...} | explicit replacements for lists of neighbors |

{fun,{},rspec} | rule obtained by applying function fun to each neighbor list |

Specifying rules for one-dimensional cellular automata.

In the simplest cases, a cellular automaton allows

k possible values or "colors" for each cell, and has rules that involve up to

r neighbors on each side. The digits of the "rule number"

n then specify what the color of a new cell should be for each possible configuration of the neighborhood.

This evolves a single neighborhood for 1 step.

Out[8]= | |

Here are the 8 possible neighborhoods for a

,

cellular automaton.

Out[9]= | |

This shows the new color of the center cell for each of the 8 neighborhoods.

Out[10]= | |

For rule 30, this sequence corresponds to the base-2 digits of the number 30.

Out[11]= | |

This runs the general

,

rule with rule number 921408.

Out[12]= | |

For a general cellular automaton rule, each digit of the rule number specifies what color a different possible neighborhood of

cells should yield. To find out which digit corresponds to which neighborhood, one effectively treats the cells in a neighborhood as digits in a number. For an

cellular automaton, the number is obtained from the list of elements

neig in the neighborhood by

.

It is sometimes convenient to consider

*totalistic* cellular automata, in which the new value of a cell depends only on the total of the values in its neighborhood. One can specify totalistic cellular automata by rule numbers or "codes" in which each digit refers to neighborhoods with a given total value, obtained for example from

.

In general,

CellularAutomaton allows one to specify rules using any sequence of weights. Another choice sometimes convenient is

, which yields outer totalistic rules.

This runs the

,

totalistic rule with code number 867.

Out[13]= | |

Rules with range

involve all cells with offsets

through

. Sometimes it is convenient to think about rules that involve only cells with specific offsets. You can do this by replacing a single

with a list of offsets.

Any

cellular automaton rule can be thought of as corresponding to a Boolean function. In the simplest case, basic Boolean functions like

And or

Nor take two arguments. These are conveniently specified in a cellular automaton rule as being at offsets

. Note that for compatibility with handling higher-dimensional cellular automata, offsets must always be given in lists, even for one-dimensional cellular automata.

This generates the truth table for 2-cell-neighborhood rule number 7, which turns out to be the Boolean function Nand.

Out[14]= | |

Rule numbers provide a highly compact way to specify cellular automaton rules. But sometimes it is more convenient to specify rules by giving an explicit function that should be applied to each possible neighborhood.

This runs an additive cellular automaton whose rule adds all values in each neighborhood modulo 4.

Out[15]= | |

The function is given the step number as a second argument.

Out[16]= | |

When you specify rules by functions, the values of cells need not be integers.

Out[17]= | |

They can even be symbolic.

Out[18]= | |

CellularAutomaton[rnum,init,t] | evolve for t steps, keeping all steps |

CellularAutomaton[rnum,init,{{t}}] | evolve for t steps, keeping only the last step |

CellularAutomaton[rnum,init,{spec_{t}}] | keep only steps specified by |

CellularAutomaton[rnum,init] | evolve rule for one step, giving only the last step |

Selecting which steps to keep.

This runs rule 30 for 5 steps, keeping only the last step.

Out[19]= | |

This keeps the last 2 steps.

Out[20]= | |

Out[21]= | |

The step specification

works very much like taking elements from a list with

Take. One difference, though, is that the initial condition for the cellular automaton is considered to be step

. Note that any step specification of the form

{...} must be enclosed in an additional list.

u | steps through u |

{u} | step u |

{u_{1},u_{2}} | steps through |

{u_{1},u_{2},du} | steps , , ... |

Cellular automaton step specifications.

This evolves for 100 steps, but keeps only every other step.

Out[22]= | |

Selecting steps and cells to keep.

Much as you can specify which steps to keep in a cellular automaton evolution, so also you can specify which cells to keep. If you give an initial condition such as

, then

r_{d} is taken to have offset 0 for the purpose of specifying which cells to keep.

All | all cells that can be affected by the specified initial condition |

Automatic | all cells in the region that differs from the background (default) |

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 |

{x_{1},x_{2}} | cells at offsets through |

{x_{1},x_{2},dx} | cells , , ... |

Cellular automaton cell specifications.

This keeps all steps, but drops cells at offsets more than 20 on the left.

Out[23]= | |

This keeps just the center column of cells.

Out[24]= | |

If you give an initial condition such as

, then

CellularAutomaton will always effectively do the cellular automaton as if there were an infinite number of cells. By using a

such as

you can tell

CellularAutomaton to include only cells at specific offsets

through

in its output.

CellularAutomaton by default includes cells out just far enough that their values never simply stay the same as in the background

blist.

In general, given a cellular automaton rule with range

, cells out to distance

on each side could in principle be affected in the evolution of the system. With

being

All, all these cells are included; with the default setting of

Automatic, cells whose values effectively stay the same as in

blist are trimmed off.

By default, only the parts that are not constant black are kept.

Out[25]= | |

Using

All for

includes all cells that could be affected by a cellular automaton with this range.

Out[26]= | |

CellularAutomaton generalizes quite directly to any number of dimensions. Above two dimensions, however, totalistic and other special types of rules tend to be more useful, since the number of entries in the rule table for a general rule rapidly becomes astronomical.

{n,k,{r_{1},r_{2},...,r_{d}}} | -dimensional rule with neighborhood |

{n,{k,1},{1,1}} | two-dimensional 9-neighbor totalistic rule |

{n,{k,{{0,1,0},{1,1,1},{0,1,0}}},{1,1}} |

| two-dimensional 5-neighbor totalistic rule |

{n,{k,{{0,k,0},{k,1,k},{0,k,0}}},{1,1}} |

| two-dimensional 5-neighbor outer totalistic rule |

Higher-dimensional rule specifications.

This is the rule specification for the two-dimensional 9-neighbor totalistic cellular automaton with code 797.

This gives steps 0 and 1 in its evolution.

Out[28]= | |

This shows step 70 in the evolution.

Out[29]= | |

This shows all steps in a slice along the

axis.

Out[30]= | |