We show that the marked version of the Post Correspondence Problem, where the words on a list are required to differ in the first letter, is decidable. On the other hand, we prove that the PCP remains undecidable if we only require the words to differ in the first two letters. Thus we locate the decidability/undecidability-boundary between marked and 2-marked PCP
Abstract — Post Correspondence Problem is an undecidable problem that was introduced by Emil Post an...
AbstractWe consider the problem of finding a shortest solution for the Post correspondence problem o...
We study two modifications of the Post Correspondence Problem (PCP), namely (1) the bi-infinite vers...
AbstractWe show that the marked version of the Post Correspondence Problem, where the words on a lis...
Abstract. We show that themarked version of the Post Correspondence Problem, where the words on a li...
AbstractIn the Post Correspondence Problem (PCP) an instance (h,g) consists of two morphisms h and g...
AbstractWe investigate properties of flatwords and k-flatwords. In particular, these words are studi...
AbstractWe give a new proof for the decidability of the binary Post Correspondence Problem (PCP) ori...
AbstractWe prove that for given morphisms g,h:{a1,a2,…,an}→B∗, it is decidable whether or not there ...
The Post correspondence problem, introduced in 1946 by Emil Post, is an important example of undecid...
AbstractWe shall show that it is decidable for binary instances of the Post Correspondence Problem w...
In 1946 Emil Leon Post (Bull. Amer. Math. Soc. 52 (1946), 264-268) introduced his famous corresponde...
In 1946, Emil Leon Post (Bulletin of Amer. Math. Soc. 52 (1946), 264-268) introduced his famouscorre...
unary alphabet. We show that the complexity of this problem heavily depends on the representation of...
The infinite Post Correspondence Problem (ωPCP) was shown to be undecidable by Ruohonen (1985) in ge...
Abstract — Post Correspondence Problem is an undecidable problem that was introduced by Emil Post an...
AbstractWe consider the problem of finding a shortest solution for the Post correspondence problem o...
We study two modifications of the Post Correspondence Problem (PCP), namely (1) the bi-infinite vers...
AbstractWe show that the marked version of the Post Correspondence Problem, where the words on a lis...
Abstract. We show that themarked version of the Post Correspondence Problem, where the words on a li...
AbstractIn the Post Correspondence Problem (PCP) an instance (h,g) consists of two morphisms h and g...
AbstractWe investigate properties of flatwords and k-flatwords. In particular, these words are studi...
AbstractWe give a new proof for the decidability of the binary Post Correspondence Problem (PCP) ori...
AbstractWe prove that for given morphisms g,h:{a1,a2,…,an}→B∗, it is decidable whether or not there ...
The Post correspondence problem, introduced in 1946 by Emil Post, is an important example of undecid...
AbstractWe shall show that it is decidable for binary instances of the Post Correspondence Problem w...
In 1946 Emil Leon Post (Bull. Amer. Math. Soc. 52 (1946), 264-268) introduced his famous corresponde...
In 1946, Emil Leon Post (Bulletin of Amer. Math. Soc. 52 (1946), 264-268) introduced his famouscorre...
unary alphabet. We show that the complexity of this problem heavily depends on the representation of...
The infinite Post Correspondence Problem (ωPCP) was shown to be undecidable by Ruohonen (1985) in ge...
Abstract — Post Correspondence Problem is an undecidable problem that was introduced by Emil Post an...
AbstractWe consider the problem of finding a shortest solution for the Post correspondence problem o...
We study two modifications of the Post Correspondence Problem (PCP), namely (1) the bi-infinite vers...
DOI
Add to ORKG