The Garden-of-Eden theorem for finite configurations. (English) Zbl 0219.02025


03B30 Foundations of classical theories (including reverse mathematics)
05B45 Combinatorial aspects of tessellation and tiling problems
Full Text: DOI


[1] Edward F. Moore, Machine models of self-reproduction, Proc. Sympos. Appl. Math., vol. 14, Amer. Math. Soc., Providence, R.I., 1962, pp. 17-33. · Zbl 0126.32408
[2] John Myhill, The converse of Moore’s Garden-of-Eden theorem, Proc. Amer. Math. Soc. 14 (1963), 685 – 686. · Zbl 0126.32501
[3] John von Neumann, Theory of self-reproducing automata, Edited and completed by Arthur W. Burks, Univ. of Illinois Press, Urbana, 1966.
[4] Arthur W. Burks , Essays on cellular automata, University of Illinois Press, Urbana, Ill.-London, 1970. · Zbl 0228.94013
[5] H. Yamada and S. Amoroso, A completeness problem for pattern generation in tessellation automata., J. Comput. System Sci. 4 (1970), 137 – 176. · Zbl 0191.31006
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.