Arrow Research search
Back to TCS

TCS 2001

Marked PCP is decidable

Journal Article journal-article Computer Science ยท Theoretical Computer Science

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, we prove that the 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.

Authors

Keywords

  • Post Correspondence Problem
  • Marked morphism
  • Decidability

Context

Venue
Theoretical Computer Science
Archive span
1975-2026
Indexed papers
16261
Paper id
858749116212721896
v2026.09.13