Summary: An Efficient Strategy for Word�Cycle Completion in Finitely Presented Groups
Luiz M. R. Gadelha Jr 
Departmento de Ci�encia de Computac� �
ao
Universidade de Bras��lia
70910�900 Bras��lia, DF � Brasil
gadelha@cic.unb.br
Mauricio Ayala�Rinc�on
Departamento de Matem�atica
Universidade de Bras��lia
70910�900 Bras��lia, DF � Brasil
ayala@mat.unb.br
Abstract
We present an efficient strategy for the application of the
inference rules of a completion procedure for finitely pre�
sented groups. This procedure has been proposed by Cre�
manns and Otto and uses a combinatorial structure called
word�cycle. Our strategy is complete in the sense that a set
of persistent word�cycles can be used to solve the reduced
word problem of the finitely presented group given as input.

Source: Ayala-Rinc�n, Mauricio - Departamento de Matem�tica, Universidade de Bras�lia

Collections: Mathematics