(cellular automata) A one-dimensional, two-state cellular automaton in which a cell's state in the next generation depends only on its current state and the states of its two immediate neighbours.

Von Neumann cellular automata are the original expression of cellular automata, the development of which was prompted by suggestions made to John von Neumann by his close friend and fellow mathematician Stanislaw Ulam.

A quantum cellular automaton is an abstract model of quantum computation, devised in analogy to conventional models of cellular automata introduced by John von Neumann.

a cellular automaton devised by the British computer scientist Edgar F. Codd in 1968.

A reversible cellular automaton is a cellular automaton in which every configuration has a unique predecessor.