In this paper we introduce the concept of a Cayley graph automatic group (CGA group or graph automatic group, for short) which generalizes the standard notion of an automatic group. Like the usual automatic groups graph automatic ones enjoy many nice properties: these groups are invariant under the change of generators, they are closed under direct and free products, certain types of amalgamated products, and finite extensions. Furthermore, the word problem in graph automatic groups is decidable in quadratic time. However, the class of graph automatic groups is much wider then the class of automatic groups. For example, we prove that all finitely generated 2-nilpotent groups and Baumslag–Solitar groups BS(1,n) are graph automatic, as well as many other metabelian groups.
Cite this article
Olga Kharlampovich, Bakhadyr Khoussainov, Alexei Miasnikov, From automatic structures to automatic groups. Groups Geom. Dyn. 8 (2014), no. 1, pp. 157–198DOI 10.4171/GGD/221