论文信息 - Condition for Injectivity of Global Maps for Tessellation Automata

Condition for Injectivity of Global Maps for Tessellation Automata

In this paper, we introduce two notions of being “balanced” and being “hard.” And we prove that these notions are necessary and sufficient conditions for global maps C ; → C and C → C of tessellation automata to be one to one, respectively, where CC denotes the set of all the (finite) configurations of tessellation automata.

Masayuki Kimura | Akira Maruoka

[1] Serafino Amoroso,et al. Decision Procedures for Surjectivity and Injectivity of Parallel Maps for Tessellation Structures , 1972, J. Comput. Syst. Sci..

[2] J. Myhill. The converse of Moore’s Garden-of-Eden theorem , 1963 .

[3] E. F. Moore. Machine Models of Self-Reproduction , 1962 .