论文信息 - Marked PCP is decidable

Marked PCP is decidable

We show that the marked version of the Post Correspondence Problem, where the words on a list are required to differ in the first letter, is decidable. On the other hand, we prove that the PCP remains undecidable if we only require the words to differ in the first two letters. Thus we locate the decidability/undecidability-boundary between marked and 2-marked PCP.

[1] Andrzej Mostowski. Review: G. S. Cejtin, An Associative Calculus with an Unsolvable Equivalence Problem , 1957 .

[2] Tero Harju,et al. Remarks on Generalized Post Correspondence Problem , 1996, STACS.

[3] Keijo Ruohonen,et al. Reversible Machines and Post's Correspondence Problem for Biprefix Morphisms , 1985, J. Inf. Process. Cybern..

[4] Andrzej Ehrenfeucht,et al. The (Generalized) Post Correspondence Problem with Lists Consisting of two Words is Decidable , 1982, Theor. Comput. Sci..

[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6] Yuri V. Matiyasevich,et al. Decision problems for semi-Thue systems with a few rules , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[7] Arto Salomaa. Jewels of formal language theory , 1981 .

[8] Emil L. Post. A variant of a recursively unsolvable problem , 1946 .

[9] Grzegorz Rozenberg,et al. Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.