Infinite Solutions of Marked Post Correspondence Problem
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.
Unable to display preview. Download preview PDF.
- 2.V. Halava. Post Correspondence Problem and Its Modifications for Marked Morphisms. PhD thesis, University of Turku, (Manuscript).Google Scholar
- 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
- 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