Results 1  10
of
4,349,808
Post Correspondence Problem for . . .
, 2005
"... In the Post Correspondence Problem (PCP) an instance (h, g) consists of two morphisms h and g, and the problem is to determine whether or not there exists a word w such that h(w) =g(w). Here we prove that the PCP is decidable for instances with unique blocks and that the infinite PCP is decidable fo ..."
Abstract
 Add to MetaCart
In the Post Correspondence Problem (PCP) an instance (h, g) consists of two morphisms h and g, and the problem is to determine whether or not there exists a word w such that h(w) =g(w). Here we prove that the PCP is decidable for instances with unique blocks and that the infinite PCP is decidable
Binary (Generalized) Post Correspondence Problem
 In Proceedings of 13th STACS
, 2000
"... 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. ..."
Abstract

Cited by 19 (9 self)
 Add to MetaCart
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.
Remarks on Generalized Post Correspondence Problem
, 1996
"... It is shown that Post Correspondence Problem remains undecidable even in the case where one of the morphisms is fixed. Accordingly the generalized PCP is undecidable even in the case where both of the morphisms are fixed, and, moreover, the cardinality of their domain alphabet is 7. In particular, G ..."
Abstract
 Add to MetaCart
It is shown that Post Correspondence Problem remains undecidable even in the case where one of the morphisms is fixed. Accordingly the generalized PCP is undecidable even in the case where both of the morphisms are fixed, and, moreover, the cardinality of their domain alphabet is 7. In particular
Primitive Solutions Of The Post Correspondence Problem
, 1996
"... s in both places for creating a very pleasant working environment. For financial support I would like to thank the Academy of Finland and Suomen Kulttuurirahasto (Elina, Sofia and Yrjo Arffman foundation). Finally, I would like to acknowledge my debt to Keijo, not only for his support, but also for ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
for making some of my algorithms into programs. Real patience was needed when one of the computer runs took three weeks. Turku, February 21st, 1996 Marjo Lipponen Contents 1 Introduction 7 1.1 Basics of language theory : : : : : : : : : : : : : : : : : : : : : 9 1.2 Post Correspondence Problem
Infinite solutions of marked Post Correspondence Problem
 FORMAL AND NATURAL COMPUTING ESSAYS DEDICATED TO GRZEGORZ ROZENBERG
, 2001
"... In an instance of the Post Correspondence Problem we are given two morphisms h; g : A ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
In an instance of the Post Correspondence Problem we are given two morphisms h; g : A
Using DNA to solve the Bounded Post Correspondence Problem
, 2000
"... Theoretical research in DNA computing includes designing practical experiments for solving various computational problems by means of DNA manipulation. This paper proposes a DNA algorithm for an NPcomplete problem, The Bounded Post Correspondence Problem. The proposed experiment can be used to test ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Theoretical research in DNA computing includes designing practical experiments for solving various computational problems by means of DNA manipulation. This paper proposes a DNA algorithm for an NPcomplete problem, The Bounded Post Correspondence Problem. The proposed experiment can be used
The generic Hanna Neumann Conjecture and Post Correspondence Problem
, 2008
"... Let F be a finitely generated free group, and K � F be a finitely generated, infinite index subgroup of F. We show that generically many finitely generated subgroups H � F have trivial intersection with all conjugates of K, thus proving a stronger, generic form of the Hanna Neumann Conjecture. As an ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. As an application, we show that the equalizer of two free group homomorphisms is generically trivial, which implies that the Post Correspondence Problem is generically solvable in free groups.
(Generalized) Post Correspondence Problem and semiThue systems
, 2008
"... Let PCP(k) denote the following restriction of the wellknown Post Correspondence Problem [9]: given alphabet Σ of cardinality k and two morphisms σ, τ: Σ ⋆ → {0,1} ⋆ , decide whether there exists w ∈ Σ + such that σ(w) = τ(w). Let Accessibility(k) denote the following restriction of the accessib ..."
Abstract
 Add to MetaCart
Let PCP(k) denote the following restriction of the wellknown Post Correspondence Problem [9]: given alphabet Σ of cardinality k and two morphisms σ, τ: Σ ⋆ → {0,1} ⋆ , decide whether there exists w ∈ Σ + such that σ(w) = τ(w). Let Accessibility(k) denote the following restriction
Undecidability of infinite Post correspondence problem for instances of size 9
 Theoretical Informatics and Applications
"... In the infinite Post Correspondence Problem an instance (h, g) consists of two morphisms h and g, and the problem is to determine whether or not there exists an infinite word ω such that h(ω) = g(ω). This problem was shown to be undecidable by K. Ruohonen (1985) in general. Recently V. D. Blondel a ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
In the infinite Post Correspondence Problem an instance (h, g) consists of two morphisms h and g, and the problem is to determine whether or not there exists an infinite word ω such that h(ω) = g(ω). This problem was shown to be undecidable by K. Ruohonen (1985) in general. Recently V. D. Blondel
Results 1  10
of
4,349,808