Discrete Mathematics/Cellular automata
Jump to navigation
Jump to search
 |
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