Involutive bases of polynomial ideals
Mathematics and Computers in Simulation - Special issue: Simplification of systems of algebraic and differential equations with applications
Mathematics and Computers in Simulation - Special issue: Simplification of systems of algebraic and differential equations with applications
Groebner Bases for Non-Commutative Polynomial Rings
AAECC-3 Proceedings of the 3rd International Conference on Algebraic Algorithms and Error-Correcting Codes
Letterplace ideals and non-commutative Gröbner bases
Journal of Symbolic Computation
On properties not inherited by monoids from their Schützenberger groups
Information and Computation
| Hi-index | 0.00 |
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.