Decision Problems For Semi-Thue Systems With A Few Rules (1996)
by
Yuri Matiyasevich
,
Géraud Sénizergues
,
A Few Rules
| Citations: | 50 - 0 self |
BibTeX
@MISC{Matiyasevich96decisionproblems,
author = {Yuri Matiyasevich and Géraud Sénizergues and A Few Rules},
title = {Decision Problems For Semi-Thue Systems With A Few Rules},
year = {1996}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
For several decision problems about semi-Thue systems, we try to locate the frontier between the decidable and the undecidable from the point of view of the number of rules. We show that the the Termination Problem, the U-Termination Problem, the Accessibility Problem and the Common-Descendant Problem are undecidable for 3 rules STS. As a corollary we obtain the undecidability of the Post-Correspondence Problem for 7 rules.
