Abstract
The de Bruijn diagram describing those decompositions of the neighborhoods of a one dimensional cellular automaton which conform to predetermined requirements of periodicity and translational symmetry shows how to construct extended configurations satisfying the same requirements. Similar diagrams, formed by stages, describe higher dimensional automata, although they become more laborious to compute with increasing neighborhood size. The procedure is illustrated by computing some still lifes for Conway's game of Life, a widely known two dimensional cellular automaton. This paper is written in September 10, 1988. © 2010 Springer-Verlag London Limited.
Cite
CITATION STYLE
McIntosh, H. V. (2010). Life’s still lifes. In Game of Life Cellular Automata (pp. 35–50). Springer London. https://doi.org/10.1007/978-1-84996-217-9_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
