TY - INPR
A1 - Madlener, Klaus
A1 - Reinert, Birgit
T1 - String Rewriting and Gröbner Bases - A General Approach to Monoid and Group Rings
N2 - The concept of algebraic simplification is of great importance for the field of symbolic computation in computer algebra. In this paper we review somefundamental concepts concerning reduction rings in the spirit of Buchberger. The most important properties of reduction rings are presented. Thetechniques for presenting monoids or groups by string rewriting systems are used to define several types of reduction in monoid and group rings. Gröbnerbases in this setting arise naturally as generalizations of the corresponding known notions in the commutative and some non-commutative cases. Severalresults on the connection of the word problem and the congruence problem are proven. The concepts of saturation and completion are introduced formonoid rings having a finite convergent presentation by a semi-Thue system. For certain presentations, including free groups and context-free groups, theexistence of finite Gröbner bases for finitely generated right ideals is shown and a procedure to compute them is given.
T3 - Reports on Computer Algebra (ZCA Report) - 16
Y1 - 1997
UR - https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/467
UR - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:hbz:386-kluedo-4385
ER -