On sufficient-completeness and related properties of term rewriting systems

This publication has 14 references indexed in Scilit:

• 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
• Complexity of certain decision problems about congruential languages
  Journal of Computer and System Sciences, 1985
• Proofs by induction in equational theories with constructors
  Journal of Computer and System Sciences, 1982
• Confluent and Other Types of Thue Systems
  Journal of the ACM, 1982
• On proving inductive properties of abstract data types
  Published by Association for Computing Machinery (ACM) ,1980
• Equations and Rewrite Rules: A Survey
  Published by Elsevier ,1980
• How to prove algebraic inductive hypotheses without induction
  Published by Springer Nature ,1980
• The algebraic specification of abstract data types
  Acta Informatica, 1978
• 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