## Some Applications Of Prefix-Rewriting In Monoids, Groups, And Rings

• Rewriting techniques have been applied successfully to various areas of symbolic computation. Here we consider the notion of prefix-rewriting and give a survey on its applications to the subgroup problem in combinatorial group theory. We will see that for certain classes of finitely presented groups finitely generated subgroups can be described through convergent prefix-rewriting systems, which can be obtained from a presentation of the group considered and a set of generators for the subgroup through a specialized Knuth-Bendix style completion procedure. In many instances a finite presentation for the subgroup considered can be constructed from such a convergent prefix-rewriting system, thus solving the subgroup presentation problem. Finally we will see that the classical procedures for computing Nielsen reduced sets of generators for a finitely generated subgroup of a free group and the Todd-Coxeter coset enumeration can be interpreted as particular instances of prefix-completion. Further, both procedures are closely related to the computation of prefix Gr"obner bases for right ideals in free group rings.

Author: Klaus Madlener, Otto Friedrich urn:nbn:de:hbz:386-kluedo-7612 Reports on Computer Algebra (ZCA Report) (22) Preprint English 1998 1998 Technische Universität Kaiserslautern 1999/11/11 Gröbner base; confluence ; coset enumeration ; monoid- and group-presentations ; prefix-rewriting ; subgroup presentation problem ; subgroup problem Fachbereich Mathematik 5 Naturwissenschaften und Mathematik / 51 Mathematik / 510 Mathematik Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011

$Rev: 13581$