AbstractWe investigate properties of flatwords and k-flatwords. In particular, these words are studied in connection with Post Correspondence Problem (PCP). An open problem occurs: where is the borderline between the decidability and the undecidability of k-flat PCP over an alphabet with n symbols? Our main results concern the related new types of prime solutions of PCP
We study two modifications of the Post Correspondence Problem (PCP), namely 1) the bi-infinite versi...
We study two modifications of the Post Correspondence Problem (PCP), namely (1) the bi-infinite vers...
Abstract — Post Correspondence Problem is an undecidable problem that was introduced by Emil Post an...
AbstractWe investigate properties of flatwords and k-flatwords. In particular, these words are studi...
Abstract. We show that themarked version of the Post Correspondence Problem, where the words on a li...
The Post correspondence problem, introduced in 1946 by Emil Post, is an important example of undecid...
AbstractIn the Post Correspondence Problem (PCP) an instance (h,g) consists of two morphisms h and g...
We show that the marked version of the Post Correspondence Problem, where the words on a list are re...
AbstractWe show that the marked version of the Post Correspondence Problem, where the words on a lis...
unary alphabet. We show that the complexity of this problem heavily depends on the representation of...
AbstractWe consider the problem of finding a shortest solution for the Post correspondence problem o...
AbstractWe prove that for given morphisms g,h:{a1,a2,…,an}→B∗, it is decidable whether or not there ...
AbstractWe shall show that it is decidable for binary instances of the Post Correspondence Problem w...
The infinite Post Correspondence Problem (ωPCP) was shown to be undecidable by Ruohonen (1985) in ge...
AbstractWe give a new proof for the decidability of the binary Post Correspondence Problem (PCP) ori...
We study two modifications of the Post Correspondence Problem (PCP), namely 1) the bi-infinite versi...
We study two modifications of the Post Correspondence Problem (PCP), namely (1) the bi-infinite vers...
Abstract — Post Correspondence Problem is an undecidable problem that was introduced by Emil Post an...
AbstractWe investigate properties of flatwords and k-flatwords. In particular, these words are studi...
Abstract. We show that themarked version of the Post Correspondence Problem, where the words on a li...
The Post correspondence problem, introduced in 1946 by Emil Post, is an important example of undecid...
AbstractIn the Post Correspondence Problem (PCP) an instance (h,g) consists of two morphisms h and g...
We show that the marked version of the Post Correspondence Problem, where the words on a list are re...
AbstractWe show that the marked version of the Post Correspondence Problem, where the words on a lis...
unary alphabet. We show that the complexity of this problem heavily depends on the representation of...
AbstractWe consider the problem of finding a shortest solution for the Post correspondence problem o...
AbstractWe prove that for given morphisms g,h:{a1,a2,…,an}→B∗, it is decidable whether or not there ...
AbstractWe shall show that it is decidable for binary instances of the Post Correspondence Problem w...
The infinite Post Correspondence Problem (ωPCP) was shown to be undecidable by Ruohonen (1985) in ge...
AbstractWe give a new proof for the decidability of the binary Post Correspondence Problem (PCP) ori...
We study two modifications of the Post Correspondence Problem (PCP), namely 1) the bi-infinite versi...
We study two modifications of the Post Correspondence Problem (PCP), namely (1) the bi-infinite vers...
Abstract — Post Correspondence Problem is an undecidable problem that was introduced by Emil Post an...
DOI
Add to ORKG