Complete involute rewriting systems
Research output: Contribution to journal › Article › peer-review
Electronic versions
DOI
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öbner basis for M. This article develops an alternative approach, using noncommutative involutive basis methods to obtain a complete involutive rewriting system for M.
Keywords
- Groebner basis, string rewriting, Knuth-Bendix, involute basis
| Original language | English |
|---|---|
| Pages (from-to) | 1034-1051 |
| Journal | Journal of Symbolic Computation |
| Volume | 42 |
| DOIs | |
| Publication status | Published - 2007 |