The Greenberg–Hastings Cellular Automaton (abbrev. GH model) is a three state two dimensional cellular automaton (abbrev CA) named after James M. Greenberg...
11 KB (1,664 words) - 21:48, 24 March 2020
A cellular automaton (pl. cellular automata, abbrev. CA) is a discrete model of computation studied in automata theory. Cellular automata are also called...
61 KB (7,606 words) - 20:44, 24 April 2024
Excitable medium (section With cellular automata)
the simplest such model is in. See Greenberg-Hastings cellular automaton for this model. Each cell of the automaton is made to represent some section of...
6 KB (794 words) - 02:27, 8 May 2024