* <math>S</math> is a finite set of cell ''states'' or ''values''.
* <math>S</math> is a finite set of cell ''states'' or ''values''.
* <math>I</math> is the finite ''neighborhood''.
* <math>I</math> is the finite ''neighborhood''.
−
* <math>f</math> is the ''local transition function''.
+
* <math>f</math> 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 local transition function with respect to the discrete time variable.
+
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.