A1 Refereed original research article in a scientific journal
Post Correspondence Problem for short words
Authors: Halava V, Harju T, Hirvensalo M, Karhumaki J
Publisher: ELSEVIER SCIENCE BV
Publication year: 2008
Journal:: Information Processing Letters
Journal name in source: INFORMATION PROCESSING LETTERS
Journal acronym: INFORM PROCESS LETT
Volume: 108
Issue: 3
First page : 115
Last page: 118
Number of pages: 4
ISSN: 0020-0190
DOI: https://doi.org/10.1016/j.ipl.2008.04.013
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. (C) 2008 Elsevier B.V. All rights reserved.
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. (C) 2008 Elsevier B.V. All rights reserved.
UTU Research Portal