A cellular automaton is a collection of "colored" cells on a grid of specified shape that evolves through a number of discrete time steps according to a set of rules based on the states of neighboring cells.
abstract machine | automata theory | code 177 | code 2040 | code 912 | elementary cellular automaton | firing squad problem | game of life | mobile automaton | Moore neighborhood | rule 102 | rule 110 | rule 150 | rule 250 | rule 30 | rule 60 | rule 90 | totalistic cellular automaton | Turing machine | universal cellular automaton | von Neumann neighborhood | WireWorld
college level