论文信息 - On the n-permutation Post Correspondence Problem

On the n-permutation Post Correspondence Problem

We give new and simpler proof for the undecidability of the n-permutation Post Correspondence Problem that was originally proved by K. Ruohonen 10. Our proof uses a recent result on deterministic semi-Thue systems according to which it is undecidable for a given deterministic semi-Thue system T and a word u whether or not there exists a nonempty cyclic derivation u ? T + u in T.

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

[2] Yuri V. Matiyasevich,et al. Decision problems for semi-Thue systems with a few rules , 2005, Theor. Comput. Sci..

[3] Tero Harju,et al. New proof for the undecidability of the circular PCP , 2013, Acta Informatica.

[4] Tero Harju,et al. Word problem for deterministic and reversible semi-Thue systems , 2014 .

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

[6] Keijo Ruohonen,et al. On some variants of Post's Correspondence Problem , 1983, Acta Informatica.

[7] Juhani Karhumäki,et al. Noneffective Regularity of Equality Languages and Bounded Delay Morphisms , 2010, Discret. Math. Theor. Comput. Sci..

[8] Emil L. Post. Recursive Unsolvability of a problem of Thue , 1947, Journal of Symbolic Logic.