Complete involute rewriting systems
Allbwn ymchwil: Cyfraniad at gyfnodolyn › Erthygl › adolygiad gan gymheiriaid
Fersiynau electronig
Dangosydd eitem ddigidol (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.
Allweddeiriau
| Iaith wreiddiol | Saesneg |
|---|---|
| Tudalennau (o-i) | 1034-1051 |
| Cyfnodolyn | Journal of Symbolic Computation |
| Cyfrol | 42 |
| Dynodwyr Gwrthrych Digidol (DOIs) | |
| Statws | Cyhoeddwyd - 2007 |