The Garden-of-Eden theorem for finite configurations

@inproceedings{Amoroso1970TheGT,
  title={The Garden-of-Eden theorem for finite configurations},
  author={S. Amoroso and G. Cooper},
  year={1970}
}
In [l] Moore showed that the existence of mutually erasable configurations in a two-dimensional tessellation space is sufficient for the existence of Garden-of-Eden configurations. In [2 ] Myhill showed that the existence of mutually indistinguishable configurations is both necessary and sufficient for the existence of Garden-of-Eden configurations. After redefining the basic concepts with some minor changes in terminology, and after restating the main results from [l] and [2], we shall… Expand
49 Citations

Figures from this paper

Confusion in the Garden of Eden
  • 5
  • PDF
On the Existence of Garden-of-Eden Configurations
  • W. Grosky
  • Computer Science, Mathematics
  • Inf. Control.
  • 1978
The Enumeration of Preimages and Gardens-of-Eden in Sequential Cellular Automata
  • 3
  • PDF
Enumerat io n of P reimages in Cellular Automata
  • Highly Influenced
  • PDF
Garden of eden configurations for 2-D cellular automata with rule 2460 N
  • 16
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 10 REFERENCES
The converse of Moore’s Garden-of-Eden theorem
  • 246
  • PDF
A Completeness Problem for Pattern Generation in Tessellation Automata
  • 22
Essays on cellular automata
  • 605
Theory of self-reproducing automata, Edited and completed by Arthur W
  • 1966
MR 27 #5698. 3. John von Neumann, Theory of self-reproducing automata
  • Math. Soc
  • 1963
Machine Models of Self-Reproduction
  • 411
Math. Amer. Math. Soc, Providence, R.I
  • Math. Amer. Math. Soc, Providence, R.I
  • 1962
License or copyright restrictions may apply to redistribution; see http://www.ams.org/journal-terms-of-use
  • License or copyright restrictions may apply to redistribution; see http://www.ams.org/journal-terms-of-use
Stevens Institute of Technology
  • Stevens Institute of Technology