Generalized PCP is decidable for marked morphisms
We prove that the generalized Post Correspondence Problem (GPCP) is decidable for marked morphisms. This result gives as a corollary a shorter proof for the decidability of the binary PCP, proved in 1982 by Ehrenfeucht, Karhumäki and Rozenberg.
Unable to display preview. Download preview PDF.
- 2.V. Halava, M. Hirvensalo and R. de Wolf. Decidability and Undecidability of Marked PCP. STACS’99 (C. Meinel and S. Tison, eds.), Lecture Notes in Comput. Sci, vol 1563, Springer-Verlag, 1999, pp. 207–216.Google Scholar
- 3.T. Harju and J. Karhumäki. Morphisms. In Handbook of Formal Languages, volume 1, 439–510. edited by G. Rozenberg and A. Salomaa, eds. Springer-Verlag, Berlin, 1997.Google Scholar
- 4.Y. Matiyasevich and G. Sènizergues. Decision problems for semi-Thue systems with a few rules. In Proceedings of the 11th IEEE Symposium on Logic in Computer Science, pages 523–531, 1996.Google Scholar