Complete involutive rewriting systems

Given a monoid string rewriting system M, one way of obtaining a complete rewriting system for M is to use the classical Knuth-Bendix critical pairs completion algorithm. It is well known that this algorithm is equivalent to computing a noncommutative Gr¨obner basis for M. This article develops an alternative approach, using noncommutative involutive basis methods to obtain a complete involutive rewriting system for M. 1 

• Type: Journal
• Year: 2007
• Where: JSC
• Authors: Gareth A. Evans, Christopher D. Wensley
• Keywords: Complete Rewriting, JSC 2007, Noncommutative Gr¨obner Basis, Rewriting System