Abstract:
Gröbner bases and Buchberger's algorithm have been generalized to monoid and group rings. In special cases, binomial prefix Gröbner bases can be applied to solve the word and generalized word problem for monoids and groups. This paper presents a discription of an implementation of prefix Gröbner basis procedures in this setting.

Birgit Reinert, Dirk Zeckzer
Fachbereich Informatik
Postfach 3049
67653 Kaiserslautern, Germany