Binary (generalized) Post Correspondence Problem - Semantic Scholar
Theoretical Computer Science 276 (2002) 183–204
www.elsevier.com/locate/tcs
Binary (generalized) Post Correspondence Problem Vesa Halavaa; b; ∗ , Tero Harjua , Mika Hirvensaloa; b;1 a Department
b TUCS-Turku
of Mathematics, University of Turku, FIN-20014 Turku, Finland Centre for Computer Science, Lemmink$aisenkatu 14 A, FIN-20520, Turku, Finland
Received August 2000; received in revised form December 2000; accepted February 2001 Communicated by A. Salomaa
Abstract We give a new proof for the decidability of the binary Post Correspondence Problem (PCP) originally proved in 1982 by Ehrenfeucht, Karhum8aki and Rozenberg. Our proof is complete c 2002 and somewhat shorter than the original proof although we use the same basic idea. Elsevier Science B.V. All rights reserved. Keywords: Post Correspondence Problem; Binary Post Correspondence Problem; Generalised Post Correspondence Problem; Marked Morphisms; Decidability
1. Introduction Let A and B be two
www.elsevier.com/locate/tcs
Binary (generalized) Post Correspondence Problem Vesa Halavaa; b; ∗ , Tero Harjua , Mika Hirvensaloa; b;1 a Department
b TUCS-Turku
of Mathematics, University of Turku, FIN-20014 Turku, Finland Centre for Computer Science, Lemmink$aisenkatu 14 A, FIN-20520, Turku, Finland
Received August 2000; received in revised form December 2000; accepted February 2001 Communicated by A. Salomaa
Abstract We give a new proof for the decidability of the binary Post Correspondence Problem (PCP) originally proved in 1982 by Ehrenfeucht, Karhum8aki and Rozenberg. Our proof is complete c 2002 and somewhat shorter than the original proof although we use the same basic idea. Elsevier Science B.V. All rights reserved. Keywords: Post Correspondence Problem; Binary Post Correspondence Problem; Generalised Post Correspondence Problem; Marked Morphisms; Decidability
1. Introduction Let A and B be two
