Binary (generalized) post correspondence problem

Authors:
Vesa Halava;Tero Harju;Mika Hirvensalo
Affiliations:
Univ. of Turku, Turku, Finland;Univ. of Turku, Turku, Finland;TUCS-Turku Centre for Computer Science, Turku, Finland
Venue:
Theoretical Computer Science
Year:
2002

Citing 5
Cited 7

Formal languages

Formal languages
Morphisms

Handbook of formal languages, vol. 1
Marked PCP is decidable

Theoretical Computer Science
Remarks on Generalized Post Correspondence Problem

STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Decision Problems for Semi-Thue Systems with a Few Rules

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science

Decidability of the binary infinite post correspondence problem

Discrete Applied Mathematics
Undecidability in ω-Regular Languages

Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Extension of the decidability of the marked PCP to instances with unique blocks

Theoretical Computer Science
Post Correspondence Problem for short words

Information Processing Letters
The block structure of successor morphisms

LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Post correspondence problem with partially commutative alphabets

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Undecidability in ω-Regular Languages

Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu

Quantified Score

Hi-index	5.23

Visualization

Abstract

We give a new proof for the decidability of the binary Post Correspondence Problem (PCP) originally proved in 1982 by Ehrenfeucht, Karhumki and Rozenberg. Our proof is complete and somewhat shorter than the original proof although we use the same basic. Copyright 2002 Elsevier Science B.V. All rights reserved.