Cellular automaton
This is an old revision of this page, as edited by Jaques (talk | contribs) at 09:24, April 20, 2007. It may differ significantly from current revision.
A cellular automaton is a 4-tuple , where:
- is a lattice.
- is a finite set of cell states or values.
- is the finite neighborhood.
- is the transition function.
The lattice is a grid filled with cells, each cell is uniquely identified by its coordinates and value. The cellular automaton evolves via the transition function with respect to the discrete time variable.