Decidability and undecidability of marked PCP

Authors:
Vesa Halava;Mika Hirvensalo;Ronald de Wolf
Affiliations:
Turku Centre for Computer Science, Turku, Finland;Turku Centre for Computer Science, Turku, Finland and Department of Mathematics, University of Turku, Turku, Finland;CWI, Amsterdam, The Netherlands and University of Amsterdam
Venue:
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Year:
1999

Citing 4
Cited 1

Handbook of Formal Languages

Handbook of Formal Languages
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
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

Generalized PCP Is Decidable for Marked Morphisms

FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that the marked version of the Post Correspondence Problem, where the words on a list are required to differ in the first letter, is decidable. On the other hand, PCP remains undecidable if we only require the words to differ in the first two letters. Thus we locate the decidability/undecidability-boundary between marked and 2-marked PCP.