Cyclic rewriting and conjugacy problems

DOI10.1515/gcc-2012-0020zbMath1286.20035arXiv1206.4431OpenAlexW2166341929MaRDI QIDQ2874367

Volker Diekert, Andrew J. Duncan, Alexei G. Myasnikov

Publication date: 30 January 2014

Published in: Groups - Complexity - Cryptology (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1206.4431

zbMATH Keywords

algorithmsconjugacy classesfree products with amalgamationrewriting systemsHNN-extensionsconjugacy problemalgorithmic group theoryStallings pregroups

Mathematics Subject Classification ID

Conjugacy classes for groups (20E45) Grammars and rewriting systems (68Q42) Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items

Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem ⋮ Confluence of algebraic rewriting systems