Skip to main content
Log in

The Structure of Infinite Solutions of Marked and Binary Post Correspondence Problems

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

In the infinite Post Correspondence Problem an instance (h,g) consists of two morphisms h and g, and the problem is to determine whether or not there exists an infinite word ω such that h(ω) = g(ω). This problem is undecidable in general, but it is known to be decidable for binary and marked instances. A morphism is binary if the domain alphabet is of size 2, and marked if each image of a letter begins with a different letter. We prove that the solutions of a marked instance form a set Eω ⋃ E* (P ⋃ F), where P is a finite set of ultimately periodic words, E is a finite set of solutions of the PCP, and F is a finite set of morphic images of fixed points of D0L systems. We also establish the structure of infinite solutions of the binary PCP.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Vesa Halava, Tero Harju or Juhani Karhumäki.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Halava, V., Harju, T. & Karhumäki, J. The Structure of Infinite Solutions of Marked and Binary Post Correspondence Problems. Theory Comput Syst 40, 43–54 (2007). https://doi.org/10.1007/s00224-005-1222-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-005-1222-6

Keywords

Navigation