6,068
edits
Changes
Jump to navigation
Jump to search
New page: A '''cellular automaton''' is a 4-tuple <math> \{ Z, S, N, f\} </math>, where: * <math>Z</math> is a lattice. * <math>S</math> is a finite set of cell ''states'' or ''values''. * <math...
A '''cellular automaton''' is a 4-tuple <math> \{ Z, S, N, f\} </math>, where:
* <math>Z</math> is a [[lattice]].
* <math>S</math> is a finite set of cell ''states'' or ''values''.
* <math>I</math> is the finite ''neighborhood''.
* <math>f</math> is the ''local 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 local transition function with respect to the discrete time variable.
[[category:mathematics]]
[[category:computer science]]
* <math>Z</math> is a [[lattice]].
* <math>S</math> is a finite set of cell ''states'' or ''values''.
* <math>I</math> is the finite ''neighborhood''.
* <math>f</math> is the ''local 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 local transition function with respect to the discrete time variable.
[[category:mathematics]]
[[category:computer science]]