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.

CellularAutomaton[rnum,init,t]evolve rule rnum from init for t steps

Generating a cellular automaton evolution.

This starts with the list given, then evolves rule 30 for four steps.
In[1]:=
Click for copyable input
Out[1]=
This shows 100 steps of rule 30 evolution from random initial conditions.
In[2]:=
Click for copyable input
Out[2]=
{a1,a2,}explicit list of values
{{a1,a2,},b}values superimposed on a b background
{{a1,a2,},blist}values superimposed on a background of repetitions of blist
{{{{a11,a12,},{d1}},},blist}values at offsets

Ways of specifying initial conditions for onedimensional 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.
In[3]:=
Click for copyable input
Out[3]=

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.
In[4]:=
Click for copyable input
Out[4]=
This shows rule 30 evolving from an initial condition consisting of a seed on a background of repeated blocks.
In[5]:=
Click for copyable input
Out[5]=

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 .
In[6]:=
Click for copyable input
Out[6]=
n, , elementary rule
{n,k}general nearestneighbor rule with k colors
{n,k,r}general rule with k colors and range r
{n,{k,1}}kcolor nearestneighbor totalistic rule
{n,{k,1},r}kcolor range-r totalistic rule
{n,{k,{wt1,wt2,}},r}rule in which neighbor i is assigned weight
{n,kspec,{{off1},{off2},,{offs}}}rule with neighbors at specified offsets
{lhs1->rhs1,lhs2->rhs2,}explicit replacements for lists of neighbors
{fun,{},rspec}rule obtained by applying function fun to each neighbor list

Specifying rules for onedimensional 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.
In[7]:=
Click for copyable input
Out[7]=
Here are the 8 possible neighborhoods for a , cellular automaton.
In[8]:=
Click for copyable input
Out[8]=
This shows the new color of the center cell for each of the 8 neighborhoods.
In[9]:=
Click for copyable input
Out[9]=
For rule 30, this sequence corresponds to the base2 digits of the number 30.
In[10]:=
Click for copyable input
Out[10]=
This runs the general , rule with rule number 921408.
In[11]:=
Click for copyable input
Out[11]=

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.
In[12]:=
Click for copyable input
Out[12]=

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 higherdimensional cellular automata, offsets must always be given in lists, even for onedimensional cellular automata.

This generates the truth table for 2cellneighborhood rule number 7, which turns out to be the Boolean function Nand.
In[13]:=
Click for copyable input
Out[13]=

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.
In[14]:=
Click for copyable input
Out[14]=
The function is given the step number as a second argument.
In[15]:=
Click for copyable input
Out[15]=
When you specify rules by functions, the values of cells need not be integers.
In[16]:=
Click for copyable input
Out[16]=
They can even be symbolic.
In[17]:=
Click for copyable input
Out[17]=
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,{spect}]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.
In[18]:=
Click for copyable input
Out[18]=
This keeps the last 2 steps.
In[19]:=
Click for copyable input
Out[19]=
This gives one step.
In[20]:=
Click for copyable input
Out[20]=

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.

usteps through u
{u}step u
{u1,u2}steps through
{u1,u2,du}steps , ,

Cellular automaton step specifications.

This evolves for 100 steps, but keeps only every other step.
In[21]:=
Click for copyable input
Out[21]=
CellularAutomaton[rnum,init,t]keep all steps, and all relevant cells
CellularAutomaton[rnum,init,{spect,specx}]
keep only specified steps and cells

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 rd is taken to have offset 0 for the purpose of specifying which cells to keep.

Allall cells that can be affected by the specified initial condition
Automaticall cells in the region that differs from the background (default)
0cell aligned with beginning of aspec
xcells at offsets up to x on the right
-xcells 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 , ,

Cellular automaton cell specifications.

This keeps all steps, but drops cells at offsets more than 20 on the left.
In[22]:=
Click for copyable input
Out[22]=
This keeps just the center column of cells.
In[23]:=
Click for copyable input
Out[23]=

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.
In[24]:=
Click for copyable input
Out[24]=
Using All for includes all cells that could be affected by a cellular automaton with this range.
In[25]:=
Click for copyable input
Out[25]=

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,{r1,r2,,rd}}dimensional rule with neighborhood
{n,{k,1},{1,1}}twodimensional 9neighbor totalistic rule
{n,{k,{{0,1,0},{1,1,1},{0,1,0}}},{1,1}}
twodimensional 5neighbor totalistic rule
{n,{k,{{0,k,0},{k,1,k},{0,k,0}}},{1,1}}
twodimensional 5neighbor outer totalistic rule

Higherdimensional rule specifications.

This is the rule specification for the twodimensional 9neighbor totalistic cellular automaton with code 797.
In[26]:=
Click for copyable input
This gives steps 0 and 1 in its evolution.
In[27]:=
Click for copyable input
Out[27]=
This shows step 70 in the evolution.
In[28]:=
Click for copyable input
Out[28]=
This shows all steps in a slice along the axis.
In[29]:=
Click for copyable input
Out[29]=