On the descriptive power of term rewriting systems
- 1 June 1986
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 2 (2) , 109-122
- https://doi.org/10.1016/s0747-7171(86)80017-7
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- About the rewriting systems produced by the Knuth-Bendix completion algorithmInformation Processing Letters, 1983
- Complete Sets of Reductions for Some Equational TheoriesJournal of the ACM, 1981
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980