论文信息 - The Surjectivity Problem for 2D Cellular Automata

The Surjectivity Problem for 2D Cellular Automata

The surjectivity problem for 2D cellular automata was proved undecidable in 1989 by Jarkko Kari. The proof consists in a reduction of a problem concerning finite tilings into the previous one. This reduction uses a special and very sophisticated tile set. In this article, we present a much more simple tile set which can play the same role.

Bruno Durand

[1] Robert L. Berger. The undecidability of the domino problem , 1966 .

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

[3] Karel Culik,et al. On the Limit Sets of Cellular Automata , 1989, SIAM J. Comput..

[4] S. J. Lee,et al. Noise in optical mixing , 1969 .

[5] Klaus Sutner. Classifying circular cellular automata , 1991 .

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

[7] N. Margolus,et al. Invertible cellular automata: a review , 1991 .

[8] D. Richardson,et al. Tessellations with Local Transformations , 1972, J. Comput. Syst. Sci..

[9] R. Robinson. Undecidability and nonperiodicity for tilings of the plane , 1971 .

[10] Kenichi Morita. A Simple Construction Method of a Reversible Finite Automaton out of Fredkin Gates, and Its Related Problem , 1990 .

[11] Jarkko Kari,et al. Reversibility and Surjectivity Problems of Cellular Automata , 1994, J. Comput. Syst. Sci..

[12] Zsuzsanna Róka,et al. One-Way Cellular Automata on Cayley Graphs , 1993, Theor. Comput. Sci..

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