You are here: TUCS > PUBLICATIONS > Publication Search > Generalized PCP is Decidable f...
Generalized PCP is Decidable for Marked Morphisms
Vesa Halava, Tero Harju, Mika Hirvensalo, Generalized PCP is Decidable for Marked Morphisms. In: FCT'99, Fundamentals of Computation Theory, Lecture Notes in Computer Science 1684, 304–315, Springer, 1999.
BibTeX entry:
@INPROCEEDINGS{pHaHaHi99a,
title = {Generalized PCP is Decidable for Marked Morphisms},
booktitle = {FCT'99, Fundamentals of Computation Theory},
author = {Halava, Vesa and Harju, Tero and Hirvensalo, Mika},
volume = {1684},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
pages = {304–315},
year = {1999},
}
Publication Forum rating of this publication: level 1