Undecidability of the surjectivity problem for 2D cellular automata: A simplified proof

  • Bruno Durand
Part of the Lecture Notes in Computer Science book series (LNCS, volume 710)


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 to this problem. 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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    S. Amoroso and Y.N. Patt. Decision procedures for surjectivity and injectivity of parallel maps for tesselation structures. J. Comp. Syst. Sci., 6:448–464, 1972.Google Scholar
  2. 2.
    R. Berger. The undecidability of the domino problem. Memoirs of the American Mathematical Society, 66, 1966.Google Scholar
  3. 3.
    J. Kari. Reversibility and surjectivity problems of cellular automata. to appear in Journal of Computer and System Sciences.Google Scholar
  4. 4.
    J. Kari. Reversability of 2d cellular automata is undecidable. Physica, D 45:379–385, 1990.Google Scholar
  5. 5.
    E.F. Moore. Machine models of self-reproduction. Proc. Symp. Apl. Math., 14:13–33, 1962.Google Scholar
  6. 6.
    J. Myhill. The converse to Moore's garden-of-eden theorem. Proc. Am. Math. Soc., 14:685–686, 1963.Google Scholar
  7. 7.
    R.M. Robinson. Undecidability and nonperiodicity for tilings of the plane. Inventiones Mathematicae, 12:177–209, 1971.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Bruno Durand
    • 1
  1. 1.Laboratoire de l'Informatique du ParallélismeUnité de Recherche Associée 1398 du CNRS Ecole Normale Supérieure de LyonLyon Cedex 07France

Personalised recommendations