6,068
edits
Changes
no edit summary
A '''cellular automaton''' is a 4-tuple <math> \{ Z, S, N, f\} </math>, where:
A '''cellular automaton''' is a 4-tuple <math> \left ( Z, S, N, f\right ) </math>, where:
* <math>Z</math> is a [[lattice]].
* <math>Z</math> is a [[lattice]].
* <math>S</math> is a finite set of cell ''states'' or ''values''.
* <math>S</math> is a finite set of cell ''states'' or ''values''.