Abstract
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.
Cite
CITATION STYLE
APA
Halava, V., Harju, T., & Hirvensalo, M. (1999). Generalized pcp is decidable for marked morphisms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1684, pp. 304–315). Springer Verlag. https://doi.org/10.1007/3-540-48321-7_25
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free