arXiv:1108.2759 Abstract | arXiv Analytics

arXiv:1108.2759 [math.GR]Abstract References Reviews Resources

Cayley automatic groups are not Cayley biautomatic

Published 2011-08-13Version 1

We show that there are Cayley automatic groups that are not Cayley biautomatic. In addition, we show that there are Cayley automatic groups with undecidable Conjugacy Problem and that the Isomorphism Problem is undecidable in the clas of Cayley automatic groups.

Categories: math.GR

Subjects: 20F10

Keywords: cayley automatic groups, cayley biautomatic, undecidable conjugacy problem, isomorphism problem

Related articles: Most relevant | Search more

arXiv:1109.2225 [math.GR] (Published 2011-09-10, updated 2012-07-10)

Isomorphism versus commensurability for a class of finitely presented groups

Goulnara Arzhantseva, Jean-Francois Lafont, Ashot Minasyan

arXiv:1802.07085 [math.GR] (Published 2018-02-20)

The isomorphism problem for finite extensions of free groups is in PSPACE

Géraud Sénizergues, Armin Weiß

arXiv:1902.00652 [math.GR] (Published 2019-02-02)

Towards quantitative classification of Cayley automatic groups