Generalized PCP Is Decidable for Marked Morphisms

Authors:
Vesa Halava;Tero Harju;Mika Hirvensalo
Affiliations:
-;-;-
Venue:
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Year:
1999

Citing 3
Cited 0

Morphisms

Handbook of formal languages, vol. 1
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 and undecidability of marked PCP

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

Quantified Score

Hi-index	0.03

Visualization

Abstract

We prove that the generalized Post Correspondence Problem (GPCP) is decidable for marked morphisms. This result gives as a corollary a shorter proof for the decidability of the binary PCP, proved in 1982 by Ehrenfeucht, Karhumäki and Rozenberg.