Finding canonical rewriting systems equivalent to a finite set of ground equations in polynomial time
- 23 November 2005
- book chapter
- Published by Springer Nature
- p. 182-196
- https://doi.org/10.1007/bfb0012832
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Termination of rewritingJournal of Symbolic Computation, 1987
- The word problem for finitely presented monoids and finite canonical rewriting systemsPublished by Springer Nature ,1987
- A finite thue system with decidable word problem and without equivalent finite canonical systemTheoretical Computer Science, 1985
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- Variations on the Common Subexpression ProblemJournal of the ACM, 1980
- Fast Decision Procedures Based on Congruence ClosureJournal of the ACM, 1980
- Complexity of finitely presented algebrasPublished by Association for Computing Machinery (ACM) ,1977