Binary (generalized) Post Correspondence Problem
We give a new proof for the decidability of the binary Post Correspondence Problem (PCP) originally proved in 1982 by \textit{A. Ehrenfeucht, J. Karhumäki} and \textit{G. Rozenberg} [Theor. Comput. Sci. 21, 119-144 (1982; Zbl 0493.68076)]. Our proof is complete and somewhat shorter than the original proof although we use the same basic idea.
scientific article; zbMATH DE number 1768179