Existence, Uniqueness, and Construction of Rewrite Systems

This publication has 13 references indexed in Scilit:

• Rewrite Systems
  Published by Elsevier ,1990
• Completion of a Set of Rules Modulo a Set of Equations
  SIAM Journal on Computing, 1986
• On the descriptive power of term rewriting systems
  Journal of Symbolic Computation, 1986
• A finite thue system with decidable word problem and without equivalent finite canonical system
  Theoretical Computer Science, 1985
• Computing with rewrite systems
  Information and Control, 1985
• Thue systems as rewriting systems
  Lecture Notes in Computer Science, 1985
• About the rewriting systems produced by the Knuth-Bendix completion algorithm
  Information Processing Letters, 1983
• A complete proof of correctness of the Knuth-Bendix completion algorithm
  Journal of Computer and System Sciences, 1981
• Equations and Rewrite Rules: A Survey
  Published by Elsevier ,1980
• Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research.
  Published by Elsevier ,1970