Cellular automata are simulations on a linear, square, or cubic grid on which each cell can be in a single state, often just ON and OFF, and where each cell operates on its own, taking the states of its neighbors as input and showing a state as output. One of the simplest examples of these would be a 1-dimensional cellular automaton in which each cell has two states, ON and OFF, which are represen
![Cellular Automata](https://cdn-ak-scissors.b.st-hatena.com/image/square/920fcd7ffaff6750400ad8ccbaa06456fc67e304/height=288;version=1;width=512/http%3A%2F%2Fmathworld.wolfram.com%2Fimages%2Feps-gif%2FUniversalCASimulated_901.gif)