Browse by author
Lookup NU author(s): Dr Andrew Duncan
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
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.
Author(s): Diekert V, Duncan A, Myasnikov AG
Publication type: Article
Publication status: Published
Journal: Groups Complexity Cryptology
Print publication date: 27/11/2012
ISSN (print): 1867-1144
ISSN (electronic): 1869-6104
Publisher: Walter de Gruyter GmbH & Co. KG
Altmetrics provided by Altmetric