Abstract In this paper, we construct an implementable algorithm that solves the conjugacy problem in twisted right-angled Artin groups (T-RAAGs). In certain cases, the complexity is known to be linear, by reducing the problem to the twisted conjugacy problem in RAAGs. We also show that T-RAAGs are biautomatic, providing an alternative solution to the conjugacy problem.
Crowe et al. (Wed,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: