The Moore-Myhill pseudo tiling for the Heisenberg tessellation automata
The notions of a Garden-of-Eden (GOE) configuration and mutually erasable configurations were discovered and investigated in the framework of Euclidean tessellations in the 1960s and 1970s. In 1993, Machi and Mignosi extended the GOE theorem for tessellation automata on Cayley graphs of non-exponential growth. We give an alternative proof to the GOE theorem for the discrete Heisenberg groups. Our proof has the advantage that it fully exploits the particular group structure so that a Moore-Myhill like tiling can be explicitly constructed. The tiling, as the wording suggests, is a spatially economic covering. The non-uniform packing method is introduced as a key technique for the construction.
Key wordstessellation automata Heisenberg groups Garden-of-Eden theorem non-Euclidean tessellation Moore-Myhill pseudo tiling
- M. Garzon, Models of Massive Parallelism, Springer, 1995.Google Scholar
- E.F. Moore, Machine models of self-reproduction. Proceedings of a Symposium of the Applied Mathematical Society, Providence, R.I., 1962, 17–33.Google Scholar
- J. Von Neumann, Theory of Self-reproducing Automata (Edited and completed by A.W. Burks). Univ. of Illinois Press, Urbana, 1966.Google Scholar
- S. Yukita, Tessellation automata on Fuchsian groups. Tech. Rep. 94-1-045, Department of Computer Software, The University of Aizu, 1994.Google Scholar