Post Correspondence Problem for short words

Authors:
Vesa Halava;Tero Harju;Mika Hirvensalo;Juhani Karhumäki
Affiliations:
Department of Mathematics and TUCS, Turku Centre for Computer Science, University of Turku, FIN-20014 Turku, Finland;Department of Mathematics and TUCS, Turku Centre for Computer Science, University of Turku, FIN-20014 Turku, Finland;Department of Mathematics and TUCS, Turku Centre for Computer Science, University of Turku, FIN-20014 Turku, Finland;Department of Mathematics and TUCS, Turku Centre for Computer Science, University of Turku, FIN-20014 Turku, Finland
Venue:
Information Processing Letters
Year:
2008

Citing 6
Cited 0

Morphisms

Handbook of formal languages, vol. 1
Binary (generalized) post correspondence problem

Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
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
Decidable and Undecidable Problems in Matrix Theory

Decidable and Undecidable Problems in Matrix Theory

Quantified Score

Hi-index	0.89

Visualization

Abstract

We prove that the generalized Post Correspondence Problem is undecidable for instances where the lengths of the image words are at most 2 and the number of pairs of words is at most 30. The proof uses undecidability of the word problem of the Tzeitin semigroup. We also transform our constructions in order to achieve a proof for the undecidability of the (not generalized) Post Correspondence Problem with image words of length at most 2.