Skip to main content
SpringerLink
Log in

Two-by-Two Substitution Systems and the Undecidability of the Domino Problem

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Logic and Theory of Algorithms (CiE 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5028))

Included in the following conference series:

Abstract

Thanks to a careful study of elementary properties of two-by-two substitution systems, we give a complete self-contained elementary construction of an aperiodic tile set and sketch how to use this tile set to elementary prove the undecidability of the classical Domino Problem.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berger, R.: The Undecidability of the Domino Problem, Ph.D. thesis, Harvard University (July 1964)

    Google Scholar 

  2. Berger, R.: The undecidability of the domino problem. Memoirs American Mathematical Society 66 (1966)

    Google Scholar 

  3. Durand, B., Levin, L., Shen, A.: Local rules and global order, or aperiodic tilings. Math. Intelligencer 27(1), 64–68 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  4. Durand, B., Romashchenko, A., Shen, A.: Fixed point and aperiodic tilings (preprint, 2007)

    Google Scholar 

  5. Grünbaum, B., Shephard, G.C.: Tilings and patterns. A Series of Books in the Mathematical Sciences. W. H. Freeman and Company, New York (1989) (an introduction)

    MATH  Google Scholar 

  6. Kahr, A.S., Moore, E.F., Wang, H.: Entscheidungsproblem reduced to the \({\forall} {\exists} {\forall}\) case. Proc. Natl. Acad. Science 48(3), 365–377 (1962)

    Article  MathSciNet  MATH  Google Scholar 

  7. Kari, J.: The nilpotency problem of one-dimensional cellular automata. SIAM J. Comput. 21(3), 571–586 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  8. Kari, J.: The tiling problem revisited (extended abstract). In: Durand-Lose, J., Margenstern, M. (eds.) MCU 2007. LNCS, vol. 4664, pp. 72–79. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  9. Lind, D., Marcus, B.: An introduction to symbolic dynamics and coding. Cambridge University Press, Cambridge (1995)

    MATH  Google Scholar 

  10. Mozes, S.: Tilings, substitution systems and dynamical systems generated by them. J. Analyse Math. 53, 139–186 (1989)

    MathSciNet  MATH  Google Scholar 

  11. Radin, C.: Miles of tiles. Student Mathematical Library, vol. 1. American Mathematical Society, Providence (1999)

    Google Scholar 

  12. Robinson, R.M.: Undecidability and nonperiodicity for tilings of the plane. Inventiones Mathematicae 12, 177–209 (1971)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d’informatique fondamentale de Marseille (LIF), Aix-Marseille Université, CNRS, 39 rue Joliot-Curie, 13013, Marseille, France

    Nicolas Ollinger

Authors
  1. Nicolas Ollinger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Arnold Beckmann Costas Dimitracopoulos Benedikt Löwe

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ollinger, N. (2008). Two-by-Two Substitution Systems and the Undecidability of the Domino Problem. In: Beckmann, A., Dimitracopoulos, C., Löwe, B. (eds) Logic and Theory of Algorithms. CiE 2008. Lecture Notes in Computer Science, vol 5028. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69407-6_51

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-69407-6_51

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-69405-2

  • Online ISBN: 978-3-540-69407-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation