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 Grobner basis for M. This article develops an alternative approach, using noncommutative involutive basis methods to obtain a complete involutive rewriting system for M. (C) 2007 Elsevier Ltd. All rights reserved.
string rewriting knuth-bendix grobner basis involutive basis