Binary (generalized) Post Correspondence Problem

https://doi.org/10.1016/S0304-3975(01)00157-8Get rights and content
Under an Elsevier user license
open archive

Abstract

We give a new proof for the decidability of the binary Post Correspondence Problem (PCP) originally proved in 1982 by Ehrenfeucht, Karhumäki and Rozenberg. Our proof is complete and somewhat shorter than the original proof although we use the same basic idea.

Keywords

Post Correspondence Problem
Binary Post Correspondence Problem
Generalised Post Correspondence Problem
Marked Morphisms
Decidability

Cited by (0)

1

Supported by the Academy of Finland under grant 44087.