A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
We introduce a version of Post Correspondence Problem (PCP, in short) generalized to words over partially commutative alphabets. Several observations are presented about the algorithmic status of the introduced problem. In particular solvability is shown for the partially commutative PCP for two special cases: the binary case of PCP (denoted by PCP (2) ), and the case with one periodic morphism. This extends solvability results for the classical PCP for these cases. Also a weaker version ofdoi:10.1007/978-3-642-13089-2_30 fatcat:7mzgxiiy4zeatg3jrrbm6wg4mu