cellular automaton in French

(computing theory) An automaton consisting of cells arranged in a regular grid, in one or more dimensions. Each application of an associated rule creates a new generation, where the cells have a new configuration of values.