Advertisement

Infinite Solutions of Marked Post Correspondence Problem

  • Vesa Halava
  • Tero Harju
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2300)

Abstract

In an instance of the Post Correspondence Problem we are given two morphisms h, g : A *B *. Here we prove that if the morphisms are marked, then it is decidable whether the instance has an infinite solution, i.e., whether or not there exists an infinite word ω such that h and g are comparable for all prefixes of ω. This problem is known to be undecidable in general for Post Correspondence Problem.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. Ehrenfeucht, J. Karhumäki, and G. Rozenberg. The (Generalized) Post Correspondence Problem with Lists Consisting of Two Words Is Decidable. Theoret. Comput. Sci., 21:119–144, 1982.zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    V. Halava. Post Correspondence Problem and Its Modifications for Marked Morphisms. PhD thesis, University of Turku, (Manuscript).Google Scholar
  3. 3.
    V. Halava, T. Harju, and M. Hirvensalo. Binary (Generalized) Post Correspondence Problem. Technical Report 357, Turku Centre for Computer Science, August 2000. to appear in Theoret. Comput. Sci.Google Scholar
  4. 4.
    V. Halava, M. Hirvensalo, and R. de Wolf. Marked PCP Is Decidable. Theoret. Comput. Sci., 255(1–2):193–204, 2001.zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Y. Matiyasevich and G. Sénizergues. Decision Problems for Semi-Thue Systems with a Few Rules. In Proceedings, 11 th Annual IEEE Symposium on Logic in Computer Science, pages 523–531, New Brunswick, New Jersey, 27–30 July 1996. IEEE Computer Society Press.Google Scholar
  6. 6.
    E. Post. A Variant of a Recursively Unsolvable Problem. Bull. of Amer. Math. Soc., 52:264–268, 1946.zbMATHMathSciNetCrossRefGoogle Scholar
  7. 7.
    K. Ruohonen. Reversible Machines and Post’s Correspondence Problem for Biprefix Morphisms. Elektron. Informationsverarb. Kybernet. (EIK), 21(12):579–595, 1985.zbMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Vesa Halava
    • 1
    • 2
  • Tero Harju
    • 1
    • 2
  1. 1.Department of MathematicsUniversity of TurkuTurkuFinland
  2. 2.TUCSTurku Centre for Computer ScienceTurkuFinland

Personalised recommendations