Cellular automata in non-euclidean spaces

WSEAS Transactions on Mathematics

Volumn 4, Issue 3, 2005, Pages 273-280

  Yukita, Shuichi ^a  

^a HOSEI UNIVERSITY   (Japan)

Author keywords

Cellular automata; Non euclidean cell spaces; The Garden of Eden theorem

Indexed keywords

ASYMPTOTIC STABILITY; BOUNDARY CONDITIONS; COMPUTATION THEORY; EQUIVALENCE CLASSES; GRAPH THEORY; PARALLEL PROCESSING SYSTEMS;

CELLULAR AUTOMATA; GARDEN-OF-EDEN THEOREM; NON EUCLIDEAN CELL SPACES;

AUTOMATA THEORY;

EID: 29844456426     PISSN: 11092769     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (19)

1. E. F. Moore, "Machine models of self-reproduction," in Proceedings of a Symposium of the Applied Mathematical Society. 1962, pp. 17-33, Providence, R.I.
2. J. Myhill, "The converse to Moore's Garden-of-Eden theorem," Proc. Amer. Math. Soc., vol. 14, pp. 685-686, 1963.
3. S. Amoroso, G. Cooper, and Y. Patt, "Some clarifications of the concept of a Garden-of-Eden configuration," J. Comput. System Sci., vol. 10, pp. 77-82, 1975.
4. A. Machi and F. Mignosi, "Garden of Eden configurations for cellular automata on Cayley graphs of groups," SIAM J. Disc. Math., vol. 6. no. 1, pp. 44-56, 1993.
5. S. Yukita, "The Moore-Myhill pseudo tiling for the Heisenberg tessellation automata," Japan J. Indust. Appl. Math., vol. 16, no. 1, pp. 47-63, 1999.
6. S. Yukita, "Dynamics of cellular automata on groups," IEICE Trans. Inf. & Syst., vol. E82-D, no. 10, pp. 1316-1323, 1999.
7. S. Yukita, "Cellular automata on groups with asymptotic boundary conditions," Trans. In-form. Processing Soc. Japan, vol. 40, no. 12, pp. 4151-4158, 1999.
8. S. Yukita, "Linear cellular automata on Cayley graphs," Japan J. Indust. Appl. Math., vol. 18, no. 1, pp. 15-24, 2001.
9. N. P. Bhatia and G. E Szegö, Dynami-cal Systems, Stability Theory and Application, Springer-Verlag, 1967.
10. T. Sato and N. Honda, "Certain relations between properties of maps of tessellation automata," J. Comput. System Sci., vol. 15, no. 2, pp. 121-145, 1977.
11. S. Yukita, "Tessellation automata on free groups," Hiroshima Math. J., vol. 25, no. 3, pp. 561-570, 1995.
12. M. Garzon, Models of Massive Parallelism, Springer, 1995.
13. A. Maruoka and M. Kimura, "Condition for injectivity of global maps for tessellation automata," Inform. and Control, vol. 32, pp. 158-162, 1976.
14. A. Maruoka and M. Kimura, "Injectivity and surjectivity of parallel maps for cellular automata," J. Comput. System Sci., vol. 18, pp. 47-64, 1979.
15. A. Maruoka and M. Kimura, "Strong surjectivity is equivalent to C-injectivity," Theoret. Comput. Sci., vol. 18, pp. 269-277, 1982.
16. m," J. Comput. System Sci., vol. 27, pp. 125-140, 1983.
17. H. Aso and N. Honda, "Dynamical character-istics of linear cellular automata," J. Comput. System Sci., vol. 30, pp. 291-317, 1985.
18. m," in Automata, Languages and Programming, 24th International Colloquium. 1997, LNCS Vol. 1256, pp. 794-804, Springer.
19. G. Manzini and L. Margara, "Attractors of linear cellular automata," J. Comput. System Sci., vol. 58, pp. 596-610, 1999.