Abstract
We show that there are Cayley graph automatic groups that are not Cayley graph biautomatic. In addition, we show that there are Cayley graph automatic groups with undecidable Conjugacy Problem and that the Isomorphism Problem is undecidable in the class of Cayley graph automatic groups. © 2012 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
APA
Miasnikov, A., & Šunić, Z. (2012). Cayley graph automatic groups are not necessarily Cayley graph biautomatic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7183 LNCS, pp. 401–407). https://doi.org/10.1007/978-3-642-28332-1_34
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free