The Knuth-Bendix Completion Procedure and Thue Systems
- 1 November 1985
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 14 (4) , 1052-1072
- https://doi.org/10.1137/0214073
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- An O(|T|3) algorithm for testing the Church-Rosser property of thue systemsTheoretical Computer Science, 1985
- Homogeneous Thue systems and the Church-Rosser propertyDiscrete Mathematics, 1984
- A note on special thue systems with a single defining relationTheory of Computing Systems, 1983
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982
- Algebraic SimplificationPublished by Springer Nature ,1982
- Confluent and Other Types of Thue SystemsJournal of the ACM, 1982
- Testing for the Church-Rosser propertyTheoretical Computer Science, 1981
- A complete proof of correctness of the Knuth-Bendix completion algorithmJournal of Computer and System Sciences, 1981
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- Rational sets in commutative monoidsJournal of Algebra, 1969