Termination of rewriting is undecidable in the one-rvle case
- 23 November 2005
- book chapter
- Published by Springer Nature
- p. 262-270
- https://doi.org/10.1007/bfb0017149
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- TerminationPublished by Springer Nature ,1985
- Thue systems as rewriting systemsLecture Notes in Computer Science, 1985
- On Proving Uniform Termination and Restricted Termination of Rewriting SystemsSIAM Journal on Computing, 1983
- Equations and Rewrite Rules: A SurveyPublished by Elsevier ,1980