The Moore-Myhill pseudo tiling for the Heisenberg tessellation automata

  • Shûichi Yukita
Article

Abstract

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 words

tessellation automata Heisenberg groups Garden-of-Eden theorem non-Euclidean tessellation Moore-Myhill pseudo tiling 

References

  1. [1]
    G.C.S. Amoroso and Y. Patt, Some clarifications of the concept of a Garden-of-Eden configuration. J. Computer and System Sciences,10 (1975), 77–82.MATHMathSciNetGoogle Scholar
  2. [2]
    M. Garzon, Models of Massive Parallelism, Springer, 1995.Google Scholar
  3. [3]
    A. Machì and F. Mignosi, Garden of Eden configurations for cellular automata on Cayley graphs of groups. SIAM J. Discrete Math.,6 (1993), 44–56.MATHCrossRefMathSciNetGoogle Scholar
  4. [4]
    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
  5. [5]
    J. Myhill, The converse to Moore’s Garden-of-Eden theorem. Proc. Amer. Math. Soc,14 (1963), 685–686.MATHCrossRefMathSciNetGoogle Scholar
  6. [6]
    J. Von Neumann, Theory of Self-reproducing Automata (Edited and completed by A.W. Burks). Univ. of Illinois Press, Urbana, 1966.Google Scholar
  7. [7]
    S. Yukita, Tessellation automata on free groups. Hiroshima Math. J.,25 (1995), 561–570. (first appeared as a Tech. Rep. 94-1-044, Department of Computer Software, The University of Aizu, 1994.)MATHMathSciNetGoogle Scholar
  8. [8]
    S. Yukita, Tessellation automata on Fuchsian groups. Tech. Rep. 94-1-045, Department of Computer Software, The University of Aizu, 1994.Google Scholar

Copyright information

© JJIAM Publishing Committee 1999

Authors and Affiliations

  • Shûichi Yukita
    • 1
  1. 1.Department of Computer SoftwareThe University of AizuFukushimaJapan

Personalised recommendations