Article PDF
Avoid common mistakes on your manuscript.
References
Berger, R.: The undecidability of the domino problem. Mem. Amer. Math. Soc. no.66, (1966).
Büchi, J. R.: Turing-machines and the Entscheidungsproblem. Math. Ann.148, 201–213 (1962).
Cocke, J., Minsky, M.: Universality of tag systems withP=2. J. Assoc. Comput. Mach.11, 15–20 (1964).
Kahr, A. S., Moore, E. F., Wang, H.: Entscheidungsproblem reduced to the AEA case. Proc. Nat. Acad. Sci. U.S.A.48, 365–377 (1962).
König, D.: Über eine Schlußweise aus dem Endlichen ins Unendliche. Acta Litt. Sci. Szeged3, 121–130 (1927).
Minsky, M. L.: Computation: Finite and infinite machines. Englewood Cliffs, N.J.: Prentice-Hall 1967.
Robinson, R. M.: Seven polygons which permit only nonperiodic tilings of the plane (abstract). Notices Amer. Math. Soc.14, 835 (1967).
Wang, H.: Proving theorems by pattern recognition — II. Bell System Tech. J.40, 1–41 (1961).
—: Dominoes and the AEA case of the decision problem, Mathematical theory of automata, p. 23–55. Brooklyn, N. Y.: Polytechnic Press 1963.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Robinson, R.M. Undecidability and nonperiodicity for tilings of the plane. Invent Math 12, 177–209 (1971). https://doi.org/10.1007/BF01418780
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01418780