A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Algorithms and reductions for rewriting problems
[chapter]
1998
Lecture Notes in Computer Science
In this paper we initiate a study of polynomial-time reductions for some basic decision problems of rewrite systems. We then give a polynomial-time algorithm for Unique-normal-form property of ground systems for the rst time. Next we prove undecidability of these problems for a xed string rewriting system using our reductions. Finally, we prove partial decidability results for Con uence of commutative semi-thue systems. The Con uence and Unique-normal-form property are shown Expspace-hard for
doi:10.1007/bfb0052369
fatcat:a4jqeyr33ve7jpkcunin6vdg6q