Abstract
It is shown that Post Correspondence Problem remains undecidable even in the case where one of the morphisms is fixed. Accordingly the generalized PCP is undecidable even in the case where both of the morphisms are fixed, and, moreover, the cardinality of their domain alphabet is 7. In particular, GPCP(7) is undecidable. On the other hand, GPCP(2) is not only decidable, but, as we show here, its all solutions can be effectively found.
Cite
CITATION STYLE
Harju, T., Karhumäki, J., & Krob, D. (1996). Remarks on generalized post correspondence problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1046, pp. 37–48). Springer Verlag. https://doi.org/10.1007/3-540-60922-9_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
