Cayley automatic groups are not Cayley biautomatic
Alexei Miasnikov, Zoran Sunic

TL;DR
This paper demonstrates that some Cayley automatic groups lack Cayley biautomaticity, and establishes the undecidability of the Conjugacy and Isomorphism Problems within this class, highlighting limitations in their algorithmic properties.
Contribution
It proves the existence of Cayley automatic groups that are not Cayley biautomatic and shows undecidability results for key decision problems in this class.
Findings
Existence of Cayley automatic groups not Cayley biautomatic
Undecidability of the Conjugacy Problem in Cayley automatic groups
Undecidability of the Isomorphism Problem in Cayley automatic groups
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · semigroups and automata theory · Finite Group Theory Research
