Add to ORKGWe study two modifications of the Post Correspondence Problem (PCP), namely 1) the bi-infinite version, where it is asked whether there exists a bi-infinite word such that two given morphisms agree on it, and 2) the conjugate version, where we require the images of a solution for two given morphisms are conjugates of each other. For the bi-infinite PCP we show that it is in the class Σ^0 _2 of the arithmetical hierarchy and for the conjugate PCP we give an undecidability proof by reducing it to the word problem for a special type of semi-Thue systems
The Post Correspondence Problem was introduced by Emil Post in 1946. The problem considers pairs of ...
Abstract. We show that themarked version of the Post Correspondence Problem, where the words on a li...
summary:Deciding whether a given word is an equality word of two nonperiodic morphisms is also known...
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...
AbstractWe shall show that it is decidable for binary instances of the Post Correspondence Problem w...
AbstractIn the Post Correspondence Problem (PCP) an instance (h,g) consists of two morphisms h and g...
The Post correspondence problem, introduced in 1946 by Emil Post, is an important example of undecid...
In 1946 Emil Leon Post (Bull. Amer. Math. Soc. 52 (1946), 264-268) introduced his famous corresponde...
AbstractWe prove that for given morphisms g,h:{a1,a2,…,an}→B∗, it is decidable whether or not there ...
In 1946, Emil Leon Post (Bulletin of Amer. Math. Soc. 52 (1946), 264-268) introduced his famouscorre...
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...
The Dual Post Correspondence Problem asks whether, for a given word α, there exists a pair of distin...
The infinite Post Correspondence Problem (ωPCP) was shown to be undecidable by Ruohonen (1985) in ge...
The Post Correspondence Problem was introduced by Emil Post in 1946. The problem considers pairs of ...
Abstract. We show that themarked version of the Post Correspondence Problem, where the words on a li...
summary:Deciding whether a given word is an equality word of two nonperiodic morphisms is also known...
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...
AbstractWe shall show that it is decidable for binary instances of the Post Correspondence Problem w...
AbstractIn the Post Correspondence Problem (PCP) an instance (h,g) consists of two morphisms h and g...
The Post correspondence problem, introduced in 1946 by Emil Post, is an important example of undecid...
In 1946 Emil Leon Post (Bull. Amer. Math. Soc. 52 (1946), 264-268) introduced his famous corresponde...
AbstractWe prove that for given morphisms g,h:{a1,a2,…,an}→B∗, it is decidable whether or not there ...
In 1946, Emil Leon Post (Bulletin of Amer. Math. Soc. 52 (1946), 264-268) introduced his famouscorre...
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...
The Dual Post Correspondence Problem asks whether, for a given word α, there exists a pair of distin...
The infinite Post Correspondence Problem (ωPCP) was shown to be undecidable by Ruohonen (1985) in ge...
The Post Correspondence Problem was introduced by Emil Post in 1946. The problem considers pairs of ...
Abstract. We show that themarked version of the Post Correspondence Problem, where the words on a li...
summary:Deciding whether a given word is an equality word of two nonperiodic morphisms is also known...