Confusion in the Garden of Eden
HTML articles powered by AMS MathViewer
- by Sven Skyum
- Proc. Amer. Math. Soc. 50 (1975), 332-336
- DOI: https://doi.org/10.1090/S0002-9939-1975-0386350-1
- PDF | Request permission
Abstract:
In this paper we examine the connection between unambiguity of cellular systems and the existence of Garden of Eden configurations in cellular automata. The examination includes both finite and infinite configurations. The connections are found by examining various properties of the global transition function.References
- S. Amoroso and G. Cooper, The Garden-of-Eden theorem for finite configurations, Proc. Amer. Math. Soc. 26 (1970), 158–164. MR 276007, DOI 10.1090/S0002-9939-1970-0276007-5
- Michael A. Arbib, Theories of abstract automata, Prentice-Hall, Inc., Englewood Cliffs, N.J., 1969. MR 0321626
- Arthur W. Burks (ed.), Essays on cellular automata, University of Illinois Press, Urbana, Ill.-London, 1970. MR 0299409 E. F. Codd, Cellular automata, ACM Monograph Series, Academic Press, New York, 1968. E. F. Moore, Machine models of self-reproduction, Proc. Sympos. Appl. Math., vol. 14, Amer. Math. Soc., Providence, R. I., 1962.
- John Myhill, The converse of Moore’s Garden-of-Eden theorem, Proc. Amer. Math. Soc. 14 (1963), 685–686. MR 155764, DOI 10.1090/S0002-9939-1963-0155764-9
- D. Richardson, Tessellations with local transformations, J. Comput. System Sci. 6 (1972), 373–388. MR 319678, DOI 10.1016/S0022-0000(72)80009-6
Bibliographic Information
- © Copyright 1975 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 50 (1975), 332-336
- MSC: Primary 68A25
- DOI: https://doi.org/10.1090/S0002-9939-1975-0386350-1
- MathSciNet review: 0386350