Sistemas de reescrita para grupos policíclicos
Saved in:
| Main Author: | |
|---|---|
| Publication Date: | 2015 |
| Format: | Master thesis |
| Language: | por |
| Source: | Repositório Institucional da UFG |
| Download full: | http://repositorio.bc.ufg.br/tede/handle/tede/4552 |
Summary: | In this work we consider monoid presentations MonhX,Ri, with set of generators X and relations R, defining groups and monoids as equivalence classes of words over X, in relation to a congruence generated by R. Taking R as a rewriting system with respect to an linear ordering of X , the set of words over X, we can apply some rewriting strategies in its laws. We use a version of the Knuth-Bendix method in R to find a confluent rewriting system equivalent to original, when such finite system exist. This new set of relations, denoted by RC(X, R), allows that in MonhX,Ri any element be defined by a unique irreducible word with respect to RC(X, R). We exhibit several examples of the execution of the Knuth-Bendix method from the functions of KBMAG package of the GAP system. Lastly, we set up a sufficient condition so that certain monoid presentations for polycyclic groups be confluent. |