Home | Quick Search | Advanced Search | Bibliography submission | Bibliography submission using bibtex | Bibliography submission using bibtex file | Links | Help | Internal

Details:

   
TitleComplete involutive rewriting systems
Author(s) Gareth Evans, Christopher D. Wensley
TypeArticle in Journal
AbstractGiven 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 .
KeywordsGröbner basis, String rewriting, Knuth–Bendix, Involutive basis
ISSN0747-7171
URL http://www.sciencedirect.com/science/article/pii/S0747717107001046
LanguageEnglish
JournalJournal of Symbolic Computation
Volume42
Number11–12
Pages1034 - 1051
Year2007
NoteNon-commutative Gröbner bases and applications
Edition0
Translation No
Refereed No
Webmaster