You currently have no access to view or download this content. Please log in with your institutional or personal account if you should have access to this content through either of these.
Showing a limited preview of this publication:
Abstract.
Cyclic words are equivalence classes of cyclic permutations of ordinary words. When a group is given by a rewriting relation, a rewriting system on cyclic words is induced, which is used to construct algorithms to find minimal length elements of conjugacy classes in the group. These techniques are applied to the universal groups of Stallings pregroups and in particular to free products with amalgamation, HNN-extensions and virtually free groups, to yield simple and intuitive algorithms and proofs of conjugacy criteria.
Keywords: Algorithmic group theory; rewriting system; conjugacy problem; HNN-extension; free product with amalgamation; Stallings pregroup
Received: 2012-06-17
Published Online: 2012-11-27
Published in Print: 2012-12-01
© 2012 by Walter de Gruyter Berlin Boston