Cellular automata is the plural word for cellular automaton. A cellular automaton is a discrete model studied in different areas of math and science. It is basically used to study cells.

E. F. Codd has written:

'Cellular automata' -- subject(s): Cellular automata

'Relational completeness of data base sublanguages'

'Relational database'

Arthur W. Burks has written:

'Chance, cause, reason' -- subject(s): Causation, Chance, Evidence, Induction (Logic)

'Essays on cellular automata' -- subject(s): Cellular automata

cellular automata is a discrete model studied in computability theory, mathematics, theoretical biology and microstructure modeling. It consists of a regular grid of cells, each in one of a finite number of states. The grid can be in any finite number of dimensions.

Automata UK ended in 1985.