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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Blumensath, A., Grädel, E.: Automatic structures. In: 15th Annual IEEE Symposium on Logic in Computer Science, Santa Barbara, CA, pp. 51–62. IEEE Comput. Soc. Press, Los Alamitos (2000)
Bogopolski, O., Martino, A., Ventura, E.: Orbit decidability and the conjugacy problem for some extensions of groups. Trans. Amer. Math. Soc. 362(4), 2003–2036 (2010)
Bridson, M.R.: Optimal isoperimetric inequalities for abelian-by-free groups. Topology 34(3), 547–564 (1995)
Bridson, M.R., Gilman, R.H.: Formal language theory and the geometry of 3-manifolds. Comment. Math. Helv. 71(4), 525–555 (1996)
Epstein, D.B.A., Cannon, J.W., Holt, D.F., Levy, S.V.F., Paterson, M.S., Thurston, W.P.: Word processing in groups. Jones and Bartlett Publishers, Boston (1992)
Grigorchuk, R.I., Nekrashevich, V.V., Sushchanskiĭ, V.I.: Automata, dynamical systems, and groups. Tr. Mat. Inst. Steklova 231(Din. Sist., Avtom. i Beskon. Gruppy), 134–214 (2000)
Kharlampovich, O., Khoussainov, B., Miasnikov, A.: From automatic structures to automatic groups (2011), arXiv:1107.3645v2
Khoussainov, B., Nerode, A.: Automatic Presentations of Structures. In: Leivant, D. (ed.) LCC 1994. LNCS, vol. 960, pp. 367–392. Springer, Heidelberg (1995)
Levitt, G.: Unsolvability of the isomorphism problem for [free abelian]-by-free groups (2008), arXiv:0810.0935v2
Šunić, Z., Ventura, E.: The conjugacy problem in automaton groups is not solvable (2010), arXiv:1010.1993v2
Zimmermann, B.: Zur Klassifikation höherdimensionaler Seifertscher Faserräume. In: Low-Dimensional Topology (Chelwood Gate, 1982). London Math. Soc. Lecture Note Ser., vol. 95, pp. 214–255. Cambridge Univ. Press, Cambridge (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Miasnikov, A., Šunić, Z. (2012). Cayley Graph Automatic Groups Are Not Necessarily Cayley Graph Biautomatic. In: Dediu, AH., Martín-Vide, C. (eds) Language and Automata Theory and Applications. LATA 2012. Lecture Notes in Computer Science, vol 7183. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28332-1_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-28332-1_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28331-4
Online ISBN: 978-3-642-28332-1
eBook Packages: Computer ScienceComputer Science (R0)