Skip to main content
SpringerLink
Log in

Domino threads and complexity

  • Chapter
  • First Online:
Computation Theory and Logic

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 270))

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature

  • Büchi, J.R. (1962): Turing machines and the Entscheidungsproblem. Math. Annalen 148, 201–213

    Google Scholar 

  • Chlebus, B.S. (1986): Domino-tiling games. J.Comp.Syst.Sci. 32, 374–392

    Google Scholar 

  • Ebbinghaus, H.-D. (1982): Undecidability of some domino connectability problems. Z.Math.Log.Grundl.Math. 28, 331–336

    Google Scholar 

  • van Emde Boas, P. (1983): Dominoes are forever. In: 1st GTI Workshop, Paderborn, 75–95

    Google Scholar 

  • Fürer, M. (1984): The computational complexity of the unconstrained limited domino problem (with implications for logical decision problems). In: E. Börger, G. Hasenjaeger, D. Rödding (eds): Logic and Machines: Decision Problems and Complexity. LNCS 171, Springer-Verlag Berlin etc., 312–319

    Google Scholar 

  • Hanf, W. (1974): Nonrecursive tilings of the plane. I. J.Symb.Logic 39, 283–285

    Google Scholar 

  • Harel, D. (1983): Recurring dominoes: Making the highly undecidable highly understandable. In: M. Karpinski (ed.): Foundations of Computation Theory. LNCS 158, Springer-Verlag Berlin etc., 177–194

    Google Scholar 

  • Harel, D. (1984): A simple highly undecidable domino problem (or, A lemma on infinite trees, with applications). In: Proc. Logic and Comp. Conf., Clayton, Victoria, Australia, Jan. 1984

    Google Scholar 

  • Kahr, A.S., Moore, E.F., Wang, H. (1962): Entscheidungsproblem reduced to the AEA case. Proc. Nat. Acad. Sci. USA 48, 365–377

    Google Scholar 

  • Myers, D. (1979): Decidability of the tiling connectability problem. Notices AMS 19, A-441

    Google Scholar 

  • Savelsbergh, M.W.P., van Emde Boas, P. (1984): Bounded tiling, an alternative to satisfiability? In: G. Wechsung (ed.): Frege Conference 1984. Akademie-Verlag Berlin, 354–363

    Google Scholar 

  • Wang, H. (1961): Proving theorems by pattern recognition. II. Bell Syst. Techn. J. 40, 1–41

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Abteilung für mathematische Logik der Universität, Albertstraße 23b, D-7800, Freiburg im Breisgau, Federal Republic of Germany

    H. -D. Ebbinghaus

Authors
  1. H. -D. Ebbinghaus
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Börger

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Ebbinghaus, H.D. (1987). Domino threads and complexity. In: Börger, E. (eds) Computation Theory and Logic. Lecture Notes in Computer Science, vol 270. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18170-9_161

Download citation

  • DOI: https://doi.org/10.1007/3-540-18170-9_161

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18170-5

  • Online ISBN: 978-3-540-47795-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation