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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
V. Halava. Post Correspondence Problem and Its Modifications for Marked Morphisms. PhD thesis, University of Turku, (Manuscript).
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.
V. Halava, M. Hirvensalo, and R. de Wolf. Marked PCP Is Decidable. Theoret. Comput. Sci., 255(1–2):193–204, 2001.
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.
E. Post. A Variant of a Recursively Unsolvable Problem. Bull. of Amer. Math. Soc., 52:264–268, 1946.
K. Ruohonen. Reversible Machines and Post’s Correspondence Problem for Biprefix Morphisms. Elektron. Informationsverarb. Kybernet. (EIK), 21(12):579–595, 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Halava, V., Harju, T. (2002). Infinite Solutions of Marked Post Correspondence Problem. In: Brauer, W., Ehrig, H., Karhumäki, J., Salomaa, A. (eds) Formal and Natural Computing. Lecture Notes in Computer Science, vol 2300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45711-9_4
Download citation
DOI: https://doi.org/10.1007/3-540-45711-9_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43190-9
Online ISBN: 978-3-540-45711-4
eBook Packages: Springer Book Archive