Discrete Mathematics/Cellular automata

From Wikibooks, open books for an open world
< Discrete Mathematics
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search
A reviewed version of this page, approved on 24 June 2017, was based off this revision.
 This page or section is an undeveloped draft or outline.
You can help to develop the work, or you can ask for assistance in the project room.

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. The rules are then applied iteratively for as many time steps as desired

Retrieved from "https://en.wikibooks.org/w/index.php?title=Discrete_Mathematics/Cellular_automata&oldid=3233782"