A cellular automaton consists of a regular grid connected with cells, each in a of a finite quantity of states, such as off and on. The grid may be in any finite quantity of dimensions. For every cell, a set of cells called its neighborhood is defined relative to the specified cell. A cellular automaton is usually a discrete model researched in comparability idea, mathematics, physics, difficulty science, theoretical chemistry and biology and micro structure modeling.
Cellular Automaton
