Aanderaa., S.O. On k-tape versus (k − 1)-tape real time computation. In Karp, R.M. editor, Complexity of Computation (Proc. Sympos., New York, 1973), pages 75–96. SIAM–AMS Proc., Vol. VII. Amer. Math. Soc., Providence, R. I., 1974.Google Scholar

Akhavi, A. Klimann, I. Lombardy, S. Mairesse, J. and Picantin, M. On the finiteness problem for automaton (semi)groups. Internat. J. Algebra Comput., 22(6):1250052–1 – 1250052–26, 2012.Google Scholar

Alešin, S.V. Finite automata and the Burnside problem for periodic groups. Mat. Zametki, 11:319–328, 1972.Google Scholar

Alonso., J.M. Inégalités isopérimétriques et quasi-isométries. C. R. Acad. Sci. Paris Sér. I Math., 311(12):761–764, 1990.Google Scholar

Alonso, J.M. Brady, T. Cooper, D. Ferlini, V. Lustig, M. Mihalik, M. Shapiro, M. and Short, H. Notes on word hyperbolic groups. In Ghys, É. Haefliger, A. and Verjovsky, A. editors, Group Theory from a Geometrical Viewpoint (Trieste, 1990), pages 3–63. World Sci. Publishing Co., Inc., River Edge, NJ, 1991.

Amir, G. Angel, O. and Virág, B. Amenability of linear-activity automaton groups. J. Eur. Math. Soc. (JEMS), 15(3):705–730, 2013.Google Scholar

Anisimov., A.V. Certain algorithmic problems for groups and context-free languages. Kibernetica, 8:4–11, 1972.Google Scholar

Antolín, Y. and Ciobanu, L. Finite generating sets of relatively hyperbolic groups and applications to geodesic languages. Trans. Amer. Math. Soc., 368(11):7965–8010, 2016.Google Scholar

Antolín, Y. and Ciobanu, L. Formal conjugacy growth in acylindrically hyperbolic groups. Int. Math. Res. Notices, pages 1–37, 2016. Available at arXiv:math/1508.06229.Google Scholar

Avenhaus, J. and Madlener, K. Subrekursive Komplexität bei Gruppen. I. Gruppen mit vorgeschriebener Komplexität. Acta Informat., 9(1):87–104, 1977/78.Google Scholar

Bahls, P. Some new biautomatic Coxeter groups. J. Algebra, 296(2):339–346, 2006.Google Scholar

Bartholdi, L. Groups of intermediate growth, 2002. Available at arXiv:math/0201293.Google Scholar

Bartholdi, L. Endomorphic presentations of branch groups. J. Algebra, 268(2):419–443, 2003.Google Scholar

Bartholdi, L. A Wilson group of non-uniformly exponential growth. C. R. Math. Acad. Sci. Paris, 336(7):549–554, 2003.Google Scholar

Bartholdi, L. FR functionally recursive groups – a GAP package, version 2.3.6, 2016. http://www.gap-system.org/Packages/fr.html.Google Scholar

Bartholdi, L. Grigorchuk, R. and Šuniḱ, Z. Branch groups. In Hazewinkel, M. editor, Handbook of Algebra, Vol. 3, pages 989–1112. North-Holland, Amsterdam, 2003.

Bartholdi, L. Kaimanovich, V.A. and Nekrashevych, V.V. On amenability of automata groups. Duke Math. J., 154(3):575–598, 2010.Google Scholar

Bartholdi, L. and Šuniḱ, Z. On the word and period growth of some groups of tree automorphisms. Comm. Algebra, 29(11):4923–4964, 2001.Google Scholar

Baumslag, G. Gersten, S.M. Shapiro, M. and Short, H. Automatic groups and amalgams. J. Pure Appl. Algebra, 76:229–316, 1991.Google Scholar

Baumslag, G. Shapiro, M. and Short, H. Parallel poly-pushdown groups. J. Pure Appl. Algebra, 140:209–227, 1999.Google Scholar

Baumslag, G. and Solitar, D. Some two-generator one-relator non-Hopfian groups. Bull. Amer. Math. Soc., 68:199–201, 1962.Google Scholar

Berns-Zieve, R. Fry, D. Gillings, J. Hoganson, H. and Mathews, H. Groups with context-free co-word problem and embeddings into Thompson's group V , 2014. Available at arXiv:math/1407.7745.Google Scholar

Bhattacharjee, M. The ubiquity of free subgroups in certain inverse limits of groups. J. Algebra, 172(1):134–146, 1995.Google Scholar

Bleak, C. Matucci, F. and Neunhöffer, M. Embeddings into Thompson's group V and coCF groups, 2013. Available at arXiv:math/1312.1855.Google Scholar

Bondarenko, E. and Nekrashevych, V. Post-critically finite self-similar groups. Algebra Discrete Math., 2(4):21–32, 2003.Google Scholar

Bondarenko, I. Bondarenko, N. Sidki, S. and Zapata, F. On the conjugacy problem for finite-state automorphisms of regular rooted trees. Groups Geom. Dyn., 7(2):323–355, 2013. With an appendix by Raphaël, M. Jungers.Google Scholar

Bondarenko, I. Grigorchuk, R. Kravchenko, R. Muntyan, Y. Nekrashevych, V. Savchuk, D. and Šunić, Z. Groups generated by 3-state automata over a 2-letter alphabet. I. São Paulo J. Math. Sci., 1(1):1–39, 2007.Google Scholar

Bondarenko, I. Grigorchuk, R. Kravchenko, R. Muntyan, Y. Nekrashevych, V. Savchuk, D. and Šunić, Z. On classification of groups generated by 3-state automata over a 2-letter alphabet. Algebra Discrete Math., (1):1–163, 2008.Google Scholar

Bondarenko, I. Grigorchuk, R. Kravchenko, R. Muntyan, Y. Nekrashevych, V. Savchuk, D. and Šunić, Z. Groups generated by 3-state automata over a 2-letter alphabet. II. J. Math. Sci. (N. Y.), 156(1):187–208, 2009.Google Scholar

Book, R.V. and Greibach, S.A. Quasi-realtime languages. Mathematical Systems Theory, 4(1):97–111, 1970.Google Scholar

Boone., W.W. Certain simple, unsolvable problems of group theory, I-VI. Indag. Math., 16 (1954) 231–237, 492–497; 17 (1955) 252–256; 19 (1957) 22–27,227–232, 1954–7.Google Scholar

Boone., W.W. The word problem. Proc. Nat. Acad. Sci. USA, 44:1061–1065, 1958.Google Scholar

Boone., W.W. The word problem. Ann. of Math. (2), 70:207–265, 1959.Google Scholar

Nicolas, Bourbaki. Groupes et Algèbres de Lie, Chapitres 4, 5 et 6. Hermann, 1968.

Bowditch., B.H. A short proof that a subquadratic isoperimetric inequality implies a linear one. Michigan Math. J., 42(1):103–107, 1995.Google Scholar

Bowditch., B.H. A course on geometric group theory, 2005. homepages.warwick.ac.uk/masgak/papers/bhb-ggtcourse.pdf.Google Scholar

Brady, N. and Bridson, M.R. There is only one gap in the isoperimetric spectrum. Geom. Funct. Anal., 10(5):1053–1070, 2000.Google Scholar

Brady, T. and McCammond, J. Three-generator Artin groups of large type are biautomatic. J. Pure Appl. Algebra, 151(1):295–310, 2000.Google Scholar

Martin, R. Bridson and André, Haefliger. Metric Spaces of Non-Positive Curvature. Springer Verlag, 1999.

Bridson., M.R. On the geometry of normal forms in discrete groups. Proc. London Math. Soc. (3), 67:596–616, 1993.Google Scholar

Bridson., M.R. Combings of groups and the grammar of reparameterization. Comment. Math. Helv., 78(4):752–771, 2003.Google Scholar

Bridson, M.R. and Gilman, R.H. Formal language theory and the geometry of 3-manifolds. Comment. Math. Helv., 71(4):525–555, 1996.Google Scholar

Bridson, M.R. and Howie., J. Conjugacy of finite subsets in hyperbolic groups. Internat. J. Algebra Comput., 15(4):725–756, 2005.Google Scholar

Bridson, M.R. and Vogtmann., K. On the geometry of the automorphism group of a free group. Bull. London Math. Soc., 27:544–552, 1995.Google Scholar

Bridson, M.R. and Vogtmann., K. Automorphism groups of free groups, surface groups and free abelian groups. In Farb, B. editor, Problems on mapping class groups and related topics, volume 74 of Proc. Sympos. Pure. Math., pages 301–316, 2006.Google Scholar

Bridson, M.R. and Vogtmann., K. The Dehn functions of Out(Fn ) and Aut(Fn ). Annales de l'Institut Fourier, 62(5):1811–1817, 2012.Google Scholar

Brieskorn, E. and Saito, K. Artin-Gruppen und Coxeter-Gruppen. Invent. Math., 17(4):245–271, 1972.Google Scholar

Brieussel, J. Folner sets of alternate directed groups. Ann. Inst. Fourier (Grenoble), 64(3):1109–1130, 2014.Google Scholar

Brink, B. and Howlett, R.B. A finiteness property and an automatic structure for Coxeter groups. Math. Ann., 296:179–190, 1993.Google Scholar

Brittenham, M. and Hermiller, S. A uniform model for almost convexity and rewriting systems. J. Group Theory, 18(5):805–828, 2015.Google Scholar

Brittenham, M. Hermiller, S. and Holt, D.F. Algorithms and topology of Cayley graphs for groups. J. Algebra, 415(1):112–136, 2014.Google Scholar

Brittenham, M. Hermiller, S. and Johnson., A. Homology and closure properties of autostackable groups. J. Algebra, 452:596–617, 2016.Google Scholar

Brittenham, M. Hermiller, S. and Susse., T. Geometry of the word problem for 3-manifold groups, 2016. Available at arXiv:math/1609.06253.Google Scholar

Brough, T. Groups with poly-context-free word problem. PhD thesis, University of Warwick, 2010.

Brough, T. Groups with poly-context-free word problem. Groups–Complexity– Cryptology, 6(1):9–29, 2014.Google Scholar

Brunner, A.M. and Sidki., S. The generation of GL(n, Z) by finite state automata. Internat. J. Algebra Comput., 8(1):127–139, 1998.Google Scholar

Buchberger, B. The history and basic features of the critical-pair/completion procedure. J. Symbolic Comput., 3:3–38, 1987.Google Scholar

Buckley, D.J. and Holt, D.F. The conjugacy problem in hyperbolic groups for finite lists of group elements. Internat. J. Algebra Comput., 23:1127–1150, 2013.Google Scholar

Burnside, W. On an unsettled question in the theory of discontinuous groups. Quart. J. Math., 33:230–238, 1902.Google Scholar

Cannon., J.W. The combinatorial structure of cocompact discrete hyperbolic group. Geom. Dedicata, 16:123–148, 1984.Google Scholar

Cannon., J.W. Almost convex groups. Geom. Dedicata, 22:197–210, 1987.Google Scholar

Cannon, J.W. Floyd, W.J. and Parry, W.R. Introductory notes on Richard Thompson's groups. Enseign. Math. (2), 42(3-4):215–256, 1996.Google Scholar

Caponi, L. On the Classification of Groups Generated by Automata with 4 States over a 2-Letter Alphabet. PhD thesis, University of South Florida, 2014. Available at http://scholarcommons.usf.edu/etd/4995.

Caprace, P.-E. and Mühlherr, B. Reflection triangles in Coxeter groups and biautomaticity. J. Group Theory, 8(4):467–489, 2005.Google Scholar

Charney, R. Geodesic automation and growth functions for Artin groups of finite type. Math. Ann., 301:307–324, 1995.Google Scholar

Charney, R. and Meier, J. The language of geodesics for Garside groups. Math. Zeitschrift, 248:495–509, 2004.Google Scholar

Charney, R. and Paris, L. Convexity of parabolic subgroups in Artin groups. Bull. London Math. Soc., 46:1248–1255, 2014.Google Scholar

Ian, M. Chiswell. A Course in Formal Languages, Automata and Groups. Springer Verlag, 2009.

Ciobanu, L. and Hermiller, S. Conjugacy growth series and languages in groups. Trans. Amer. Math. Soc., 366:2803–2825, 2014.Google Scholar

Ciobanu, L. Hermiller, S. Holt, D.F. and Rees., S. Conjugacy languages in groups. Israel J. Math, 211:311–347, 2015.Google Scholar

Collins., D.J. A simple presentation of a group with unsolvable word problem. Illinois J. Math., 30 (2):230–234, 1986.Google Scholar

Dahmani, F. and Guirardel, V. The isomorphism problem for all hyperbolic groups. Geom. Funct. Anal., 21:223300, 2011.Google Scholar

Day., M.M. Amenable semigroups. Illinois J. Math., 1:509–544, 1957.Google Scholar

Pierre de la, Harpe. Topics in Geometric Group Theory. Chicago Lectures in Mathematics. University of Chicago Press, Chicago, IL, 2000.

Dehn, M. Über unendliche diskontinuierliche Gruppen. Math. Ann., 71:116–144, 1911.Google Scholar

Dehn, M. Transformationen der Kurve auf zweiseitigen Flächen. Math. Ann., 72:413–420, 1912.Google Scholar

Dehornoy, P. Groupes de Garside. Ecole Norm. Sup.(4), 35:267–306, 2002.Google Scholar

Dehornoy, P. and Paris, L. Garside groups, two generalisations of Artin groups. Proc. London Math. Soc., 73:569–604, 1999.Google Scholar

Dunwoody., M.J. The accessibility of finitely presented groups. Invent. Math., 81:449–457, 1985.Google Scholar

Edjvet, M. and Juhàsz, A. The groups Gm,n,p . J. Algebra, 319:248–266, 2008.Google Scholar

Elder, M. Finiteness and the falsification by fellow traveler property. Geom. Dedicata, 95:103–113, 2002.Google Scholar

Elder, M. Regular geodesic languages and the falsification by fellow traveler property. Algebr. Geom. Topol. (electronic), 5:129–134, 2005.Google Scholar

Elder, M. and Taback, J. C-graph automatic groups. J. Algebra, 413:289–319, 2014.Google Scholar

David, B.A. Epstein, Cannon, J.W. Holt, D.F. Levy, S.V.F. Paterson, M.S. and Thurston, W.P. Word Processing in Groups. Jones and Bartlett, Boston, 1992.

Epstein, D.B.A. and Holt, D.F. The linearity of the conjugacy problem in word-hyperbolic groups. Internat. J. Algebra Comput., 16:287–305, 2006.Google Scholar

Epstein, D.B.A. Holt, D.F. and Rees, S.E. The use of Knuth-Bendix methods to solve the word problem in automatic groups. J. Symbolic Comput., 12:397–414, 1991.Google Scholar

Epstein, D.B.A. Iano-Fletcher, A.R. and Zwick, U. Growth functions and automatic groups. Experiment. Math., 5(4):297–315, 1996.Google Scholar

Erschler, A. Not residually finite groups of intermediate growth, commensurability and non-geometricity. J. Algebra, 272(1):154–172, 2004.Google Scholar

Gersten., S.M. Isoperimetric and isodiametric functions of finite presentations. In Niblo, G.A. and Roller, M.A. editors, Geometric Group Theory, Volume 1, volume 181 of London Mathematical Society Lecture Note Series, pages 79–96. Cambridge University Press, 1993.

Gersten, S.M. and Riley, T.R. Filling length in finitely presentable groups. Geom. Dedicata, 92:4158, 2002.Google Scholar

Gersten, S.M. and Short., H. Small cancellation theory and automatic groups. Invent. Math., 102(2):305–334, 1990.Google Scholar

Gersten, S.M. and Short., H. Small cancellation theory and automatic groups, II. Invent. Math., 105(3):641–662, 1991.Google Scholar

Gersten, S.M. and Short, H.B. Rational subgroups of biautomatic groups. Ann. of Math., 134(1):125–158, 1991.Google Scholar

Ghys, É. and de la Harpe, P. editors. Sur les groupes hyperboliques d'après Mikhael Gromov, volume 83 of Progress in Mathematics. Birkhäuser Boston, Inc., Boston, MA, 1990.

Gillibert, P. The finiteness problem for automaton semigroups is undecidable. Internat. J. Algebra Comput., 24(1):1–9, 2014.Google Scholar

Gilman., R.H. Presentations of groups and monoids. J. Algebra, 57:544–554, 1979.Google Scholar

Gilman., R.H. Enumerating infinitely many cosets. In Atkinson, M.D. editor, Computational Group Theory, pages 51–55, London, New York, 1984. Academic Press.

Gilman., R.H. On the definition of word hyperbolic groups. Math. Z., 242:529–541, 2002.Google Scholar

Gilman, R.H. Holt, D.F. Hermiller, S. and Rees, S. A characterisation of virtually free groups. Arch. Math., 89:289–295, 2007.Google Scholar

Gilman, R.H. Holt, D.F. and Rees., S. Combing nilpotent and polycyclic groups. Internat. J. Algebra Comput., 9:135–155, 1999.Google Scholar

Ginsburg, S. and Spanier, E. Semigroups, Presburger formulas, and languages. Pacific J. Math., 16(2):285–296, 1966.Google Scholar

Seymour, Ginsburg. The Mathematical Theory of Context-free Languages. McGraw-Hill, 1966.

Glasner, Y. and Mozes, S. Automata and square complexes. Geom. Dedicata, 111:43–64, 2005.Google Scholar

Godelle, E. and Paris, L. Basic questions on Artin-Tits groups. In Configuration Spaces, volume 14 of CRM Series, pages 299–311. Ed. Norm., Pisa, 2012.

Goldstine, J. A simplified proof of Parikh's theorem. Discrete Mathematics, 19:235–239, 1977.Google Scholar

Golod., E.S. On nil-algebras and finitely approximable p-groups. Izv. Akad. Nauk SSSR Ser. Mat., 28:273–276, 1964. English translation: Amer. Math. Transl. (2), 48:103–106, 1965.Google Scholar

Golod, E.S. and Šafarevič, I.R. On the class field tower. Izv. Akad. Nauk SSSR Ser. Mat., 28:261–272, 1964.Google Scholar

Goodman, O. and Shapiro, M. On a generalization of Dehn's algorithm. Internat. J. Algebra Comput., 18:1137–1177, 2008.Google Scholar

Gorun, I. A hierarchy of context-sensitive languages. Lect. Notes Comput. Sc., 45:299–303, 1976.Google Scholar

Greendlinger, M. Dehn's algorithm for the word problem. Comm. Pure Appl. Math., 13:67–83, 1960.Google Scholar

Greendlinger, M. On Dehn's algorithm for the conjugacy and word problem. Comm. Pure Appl. Math., 13:641–677, 1960.Google Scholar

Greendlinger, M. On the word problem and the conjugacy problem (Russian). Akad. Nauk SSSR Ser. Mat., 29:245–268, 1965.Google Scholar

Gregorac, R. On generalized free products of finite extensions of free groups. J. London Math. Soc., 41:662–666, 1966.Google Scholar

Grigorchuk., R.I. On Burnside's problem on periodic groups. Funktsional. Anal. i Prilozhen., 14(1):53–54, 1980.Google Scholar

Grigorchuk., R.I. On the Milnor problem of group growth. Dokl. Akad. Nauk SSSR, 271(1):30–33, 1983.Google Scholar

Grigorchuk., R.I. Degrees of growth of finitely generated groups and the theory of invariant means. Izv. Akad. Nauk SSSR Ser. Mat., 48(5):939–985, 1984.Google Scholar

Grigorchuk., R.I. Degrees of growth of p-groups and torsion-free groups. Mat. Sb. (N.S.), 126(168)(2):194–214, 286, 1985.Google Scholar

Grigorchuk., R.I. An example of a finitely presented amenable group that does not belong to the class EG. Mat. Sb., 189(1):79–100, 1998.Google Scholar

Grigorchuk., R.I. Just infinite branch groups. In du Sautoy, M. Segal, D. and Shalev, A. editors, New horizons in pro-p groups, volume 184 of Progr. Math., pages 121–179. Birkhäuser Boston, Boston, MA, 2000.

Grigorchuk., R.I. Solved and unsolved problems around one group. In Bartholdi, L. Ceccherini-Silberstein, T. Smirnova-Nagnibeda, T. and Zuk, A. editors, Infinite groups: geometric, combinatorial and dynamical aspects, volume 248 of Progr. Math., pages 117–218. Birkhäuser, Basel, 2005.

Grigorchuk, R.I. Linnell, P. Schick, T. and Żuk, A. On a question of Atiyah. C. R. Acad. Sci. Paris Sér. I Math., 331(9):663–668, 2000.Google Scholar

Grigorchuk, R.I. Nekrashevich, V.V. and Sushchanskiĭ, V.I. Automata, dynamical systems, and groups. Tr. Mat. Inst. Steklova, 231(Din. Sist., Avtom. i Beskon. Gruppy):134–214, 2000.

Grigorchuk, R.I. and Żuk, A. The lamplighter group as a group generated by a 2-state automaton, and its spectrum. Geom. Dedicata, 87(1-3):209–244, 2001.Google Scholar

Gromov, M. Groups of polynomial growth and expanding maps. Publications Mathématique d'IHÉS, 53:53–78, 1981.Google Scholar

Gromov, M. Hyperbolic groups. In Gersten, S.M. editor, Essays in Group Theory, volume 8 of MSRI Publ., pages 75–263. Springer, 1987.

Gromov, M. Asymptotic invariants of infinite groups. In Niblo, G.A. and Roller, M.A. editors, Geometric Group Theory, Volume 2, volume 182 of London Mathematical Society Lecture Note Series, pages 1–295. Cambridge University Press, 1993.

Mikhael, Gromov. Structures métriques pour les variétés riemanniennes, volume 1 of Textes Mathématiques [Mathematical Texts]. CEDIC, Paris, 1981. Edited by Lafontaine, J. and Pansu, P..

Gupta, C.K. Gupta, N.D. and Oliynyk, A.S. Free products of finite groups acting on regular rooted trees. Algebra Discrete Math., (2):91–103, 2007.Google Scholar

Gupta, N. and Sidki, S. Some infinite p-groups. Algebra i Logika, 22(5):584–589, 1983.Google Scholar

Hamenstädt, U. Geometry of the mapping class group II: A biautomatic structure, 2009.Google Scholar

Harkins, A. Combing lattices of soluble Lie groups. PhD thesis, University of Newcastle, 2001.

Hartmanis, J. and Stearns, R.E. On the computational complexity of algorithms. Trans. Amer. Math. Soc., 117(5):285–306, 1965.Google Scholar

Havas, G. and Holt, D.F. On Coxeter's families of group presentations. J. Algebra, 324(5):1076–1082, 2010.Google Scholar

Herbst, T. On a subclass of context-free groups. RAIRO Inform. Théor. Appl., 25:255–272, 1991.Google Scholar

Herbst, T. and Thomas, R.M. Group presentations, formal languages and characterizations of one-counter groups. Theoret. Comput. Sci., 112(2):187–213, 1993.Google Scholar

Hermiller, S. Holt, D.F. and Rees., S. Star-free geodesic languages for groups. Internat. J. Algebra Comput., 17:329–345, 2007.Google Scholar

Hermiller, S. Holt, D.F. and Rees., S. Groups whose geodesics are locally testable. Internat. J. Algebra Comput., 18:911–923, 2008.Google Scholar

Hermiller, S. and Martínez-Pérez, C. HNN-extensions and stackable groups, 2016. Available at arXiv:1605.06145.Google Scholar

Hermiller, S. and Meier, J. Algorithms and geometry for graph products of groups. J. Algebra, 171(1):230–257, 1995.Google Scholar

Israel, N. Herstein. Noncommutative rings, volume 15 of Carus Mathematical Monographs. Mathematical Association of America, Washington, DC, 1994. Reprint of the 1968 original, with an afterword by Lance, W. Small.

Higman, G. Neumann, B.H. and Neumann., H. Embedding theorems for groups. J. London Math. Soc., 24:247–254, 1949.Google Scholar

Graham, Higman. Finitely presented infinite simple groups, volume 8 of Notes on Pure Mathematics. The Australian National University, 1974.

Hirsch., K.A. On infinite soluble groups, III. Proc. London Math. Soc. (2), 49:184–194, 1946.Google Scholar

Derek, F. Holt, Bettina, Eick, and Eamonn, A. O'Brien. Handbook of Computational Group Theory. Chapman & Hall/CRC, 2005.

Holt., D.F. The Warwick automatic group software. In Baumslag, G. et al., editors, Geometric and Computational Perspectives on Infinite Groups, volume 25 of Amer. Math. Soc. DIMACS Series, pages 69–82. (DIMACS, 1994), 1995.

Holt., D.F. KBMAG (Knuth-Bendix in Monoids and Automatic groups), 2000. http://www.warwick.ac.uk/staff/D.F.Holt/download/kbmag2/.

Holt., D.F. Word-hyperbolic groups have real-time word problem. Internat. J. Algebra Comput., 10(2):221–227, 2000.Google Scholar

Holt., D.F. Garside groups have the falsification by fellow-traveller property. Groups Geom. Dyn., 4:777–784, 2010.Google Scholar

Holt, D.F. and Hurt, D.F. Computing automatic coset systems and subgroup presentations. J. Symbolic Comput., 27:1–19, 1999.Google Scholar

Holt, D.F. Owens, M.D. and Thomas, R.M. Groups and semigroups with a one-counter word problem. J. Australian Math. Soc., 85:197–209, 2008.Google Scholar

Holt, D.F. and Rees., S. Solving the word problem in real time. J. Lond. Math. Soc. (2), 63:623–639, 2001.Google Scholar

Holt, D.F. and Rees., S. Artin groups of large type are shortlex automatic with regular geodesics. Proc. Lond. Math. Soc. (3), 104(3):486–512, 2012.Google Scholar

Holt, D.F. Rees, S. and Röver, C.E. Groups with context-free conjugacy problems. Internat. J. Algebra Comput., 21(1–2):193–216, 2011.Google Scholar

Holt, D.F. Rees, S. Röver, C.E. and Thomas, R.M. Groups with context-free coword problem. J. Lond. Math. Soc. (2), 71:643–657, 2005.Google Scholar

Holt, D.F. Rees, S. and Shapiro., M. Groups that do and do not have growing context-sensitive word problem. Internat. J. Algebra Comput., 18:1179–1191, 2008.Google Scholar

Holt, D.F. and Röver, C.E. On real-time word problems. J. Lond. Math. Soc. (2), 67:289–301, 2003.Google Scholar

Holt, D.F. and Röver, C.E. Groups with indexed co-word problem. Internat. J. Algebra Comput., 16(5):985–1014, 2006.Google Scholar

John, E. Hopcroft, Rajeev, Motwani, and Jeffrey, D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 2006. Third edition.

John, E. Hopcroft and Jeffrey, D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979. First edition.

Hopf, H. Enden offener Räume und unendliche diskontinuierliche Gruppen. Comment. Math. Helv., 16:81–100, 1944.Google Scholar

Howlett., R.B. Miscellaneous facts about Coxeter groups. Lectures given at the ANU Group Actions Workshop, October 1993, 1993. http://www.maths.usyd.edu.au:8000/res/Algebra/How/anucox.html.

James, E. Humphreys. Reflection groups and Coxeter groups, volume 29 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 1990.

Immerman, N. Nondeterministic space is closed under complementation. SIAM J. Comput., 17(5):935–938, 1988.Google Scholar

Incitti, R. Regularities on the Cayley graphs of groups of linear growth. Europ. J. Combinatorics, 18:175–178, 1997.Google Scholar

Karass, A. Pietrowski, A. and Solitar., D. Recursive predicates and quantifiers. J. Austral. Math. Soc., 16:458–466, 1973.Google Scholar

Kharlampovich, O. Khoussainov, B. and Miasnikov., A. From automatic structures to automatic groups. Groups Geom. Dyn., 8(1):157–198, 2014.Google Scholar

Kleene., S.C. Recursive predicates and quantifiers. Trans. Amer. Math. Soc., 53:41–73, 1943.Google Scholar

Klimann, I. The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable. In 30th International Symposium on Theoretical Aspects of Computer Science, volume 20 of LIPIcs. Leibniz Int. Proc. Inform., pages 502–513. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2013.

Klimann, I. and Picantin, M. A characterization of those automata that structurally generate finite groups. In LATIN 2014: theoretical informatics, volume 8392 of Lecture Notes in Comput. Sci., pages 180–189. Springer, Heidelberg, 2014.

Klimann, I. Picantin, M. and Savchuk., D. A connected 3-state reversible Mealy automaton cannot generate an infinite Burnside group. In Developments in language theory, volume 9168 of Lecture Notes in Comput. Sci., pages 313–325. Springer, Cham, 2015.

Klimann, I. Picantin, M. and Savchuk., D. Orbit automata as a new tool to attack the order problem in automaton groups. J. Algebra, 445:433–457, 2016.Google Scholar

Knuth, D.E. and Bendix, P.B. Simple word problems in universal algebras. In Leech, J. editor, Computational Problems in Abstract Algebra, pages 263–297, Oxford, 1970. (Oxford, 1967), Pergamon Press.

Krammer, D. The conjugacy problem for Coxeter groups. Groups Geom. Dyn., 3(1):71–171, 2009.Google Scholar

Lakin, S. Context-sensitive decision problems in groups. PhD thesis, University of Leicester, 2002.

Lakin, S.R. and Thomas, R.M. Context-sensitive decision problems in groups. In Calude, C.S. Calude, E. and Dinneen, M.J. editors, Developments in Language Theory: 8th International Conference, DLT 2004, Auckland, New Zealand, volume 3340 of Lecture Notes in Computer Science, pages 296–307. Springer-Verlag, 2004.

Lakin, S.R. and Thomas, R.M. Complexity classes and word problems of groups. Groups Complex. Cryptol., 1(2):261–273, 2009.Google Scholar

Lavreniuk, Y. and Nekrashevych, V. Rigidity of branch groups acting on rooted trees. Geom. Dedicata, 89:159–179, 2002.Google Scholar

Lehnert, J. and Schweitzer, P. The co-word problem for the Higman-Thompson group is context-free. Bull. Lond. Math. Soc., 39(2):235–241, 2007.Google Scholar

Leonov, Yu.G. The conjugacy problem in a class of 2-groups. Mat. Zametki, 64(4):573–583, 1998.Google Scholar

Lubotzky, A. Mann, A. and Segal., D. Finitely generated groups of polynomial subgroup growth. Israel J. Math., 82(1-3):363–371, 1993.Google Scholar

Lubotzky, A. Pyber, L. and Shalev., A. Discrete groups of slow subgroup growth. Israel J. Math., 96(part B):399–418, 1996.Google Scholar

Lyndon., R.C. On Dehn's algorithm. Math. Ann., 166:208–228, 1966.Google Scholar

Roger, C. Lyndon and Paul, E. Schupp. Combinatorial Group Theory. Classics in Mathematics. Springer-Verlag, Berlin, 2001. Reprint of the 1977 edition.

Lysënok, I.G. A set of defining relations for the Grigorchuk group. Mat. Zametki, 38(4):503–516, 634, 1985. English translation: Math. Notes 38(3-4):784–792, 1985.Google Scholar

Macedońska, O. Nekrashevych, V. and Sushchansky, V. Commensurators of groups and reversible automata. Dopov. Nats. Akad. Nauk Ukr. Mat. Prirodozn. Tekh. Nauki, (12):36–39, 2000.Google Scholar

Madlener, K. and Otto, F. Pseudonatural algorithms for the word problem for finitely presented groups and monoids. J. Symbolic Comput., 1:383–418, 1985.Google Scholar

Avinoam, Mann. How groups grow, volume 395 of London Mathematical Society Lecture Note Series. Cambridge University Press, Cambridge, 2012.

Maslov., A.N. The cyclic shift of languages. Problemy Peredači Informacii, 9(4):81–87, 1973.Google Scholar

William, S. Massey. Algebraic Topology: An Introduction. Springer-Verlag, New York-Heidelberg, 1977. Reprint of the 1967 edition, Graduate Texts in Mathematics, Vol. 56.

Mennicke, J. Einige endliche Gruppen mit drei Erzeugenden und drei Relationen. Arch. Math., 10:409–418, 1959.Google Scholar

Miasnikov, A. and Šunić, Z. Cayley graph automatic groups are not necessarily Cayley graph biautomatic. In Dediu, A.-H. and Martín-Vide, C. editors, Language and Automata Theory and Applications, volume 7183 of Lecture Notes in Computer Science, pages 401–407. Springer Berlin Heidelberg, 2012.

Miller, C.F. III. Decision problems for groups – survey and reflections. In Baumslag, G. and Miller, C.F. III, editors, Algorithms and Classification in Combinatorial Group Theory, pages 1–59. Springer, New York, 1992.

Milnor, J. A note on curvature and the fundamental group. J. Differential Geom., 2:1–7, 1968.Google Scholar

Milnor, J. Problem 5605. Amer. Math. Monthly, 75:685–686, 1968.

Mosher, L. Mapping class groups are automatic. Ann. of Math., 142(2):303–384, 1995.Google Scholar

Mosher, L. Central quotients of biautomatic groups. Comment. Math. Helv., 72(1):16–29, 1997.Google Scholar

Moussong, G. Hyperbolic Coxeter groups. PhD thesis, Ohio State University, 1988.

Muller, D.E. and Schupp, P.E. Groups, the theory of ends, and context-free languages. J. Comp. System Sci., 26:295–310, 1983.Google Scholar

Muntyan, Y. and Savchuk, D. automgrp automata groups – a GAP package, version 1.3, 2016. http://www.gap-system.org/Packages/automgrp.html.

Nekrashevych, V. and Sidki, S. Automorphisms of the binary tree: state-closed subgroups and dynamics of 1/2-endomorphisms. In Groups: topological, combinatorial and arithmetic aspects, volume 311 of London Math. Soc. Lecture Note Ser., pages 375–404. Cambridge Univ. Press, Cambridge, 2004.

Volodymyr, Nekrashevych. Self-similar groups, volume 117 of Mathematical Surveys and Monographs. American Mathematical Society, Providence, RI, 2005.

Neumann, W.D. and Reeves., L. Central extensions of word hyperbolic groups. Ann. of Math. (2), 145:183–287, 1997.Google Scholar

Neumann, W.D. and Shapiro., M. A short course in geometric group theory. Notes for the ANU Workshop January/February 1996. http://at.yorku.ca/i/a/a/i/13.htm.Google Scholar

Neumann, W.D. and Shapiro., M. Automatic structures, rational growth, and geometrically finite hyperbolic groups. Invent. Math., 120:259–287, 1995.Google Scholar

Niblo, G.A. and Reeves, L.D. Coxeter groups act on CAT(0) cube complexes. J. Group Theory, 6:399–413, 2003.Google Scholar

Novikov., P.S. On algorithmic unsolvability of the problem of the identity (Russian). Doklady Akad. Nauk SSSR, 85:709–712, 1952.Google Scholar

Ol'shanskii, A.Yu. Hyperbolicity of groups with subquadratic isoperimetric inequalities. Internat. J. Algebra Comput., 1:281–289, 1991.Google Scholar

Oshiba, T. Closure property of the family of context-free languages under the cyclic shift operation. Electron. Commun. Japan, 55(4):119–122, 1972.Google Scholar

Papasoglu, P. On the sub-quadratic isoperimetric inequality. In Charney, R. Davis, M. and Shapiro, M. editors, Geometric Group Theory, pages 149–158. de Gruyter-New York, 1995.

Papasoglu, P. Strongly geodesically automatic groups are hyperbolic. Invent. Math., 121(2):323–334, 1995.Google Scholar

Parikh., R.J. Language generating devices. MIT Res. Lab. Electron. Quart. Prog. Rep., 60:199–212, 1961.Google Scholar

Parkes, D.W. and Thomas, R.M. Groups with context-free reduced word problem. Communications in Algebra, 30:3143–3156, 2002.Google Scholar

Peifer, D. Artin groups of extra-large type are biautomatic. J. Pure Appl. Algebra, 110:15–56, 1996.Google Scholar

Jean-Éric, Pin. Varieties of Formal Languages. Plenum Publishing Corp., New York, 1986.

Rabin., M.O. Real time computation. Israel J. Math., 1:203–211, 1963.Google Scholar

Rebecchi., D.Y. Algorithmic properties of relatively hyperbolic groups. PhD thesis, Rutgers, Newark, 2003. Available at arXiv:math/0302245.

Redfern, I. Automatic coset sytems. PhD thesis, University of Warwick, 1993.

Riley., T.R. The geometry of groups satisfying weak almost-convexity or weak geodesic-combability conditions. J. Group Theory, 5:513–525, 2002.Google Scholar

Rips, E. Subgroups of small cancellation groups. Bull. London Math. Soc., 14:45–47, 1982.Google Scholar

Rivin, I. Growth in free groups (and other stories)-twelve years later. Illinois J. Math., 54:327–370, 2010.Google Scholar

Derek, J.S. Robinson. A Course in the Theory of Groups, volume 80 of Graduate Texts in Mathematics. Springer-Verlag, New York, second edition, 1996.

Rosenberg, A. Real-time definable languages. J. Assoc. Comput. Mach., 14:645–662, 1967.Google Scholar

Joseph, J. Rotman. An Introduction to the Theory of Groups. Springer-Verlag, Berlin and Heidelberg, 4th edition, 1995.

Röver, C.E. Abstract commensurators of groups acting on rooted trees. Geom. Dedicata, 94:45–61, 2002. Proceedings of the Conference on Geometric and Combinatorial Group Theory, Part I (Haifa, 2000).Google Scholar

Rozhkov., A.V. The conjugacy problem in an automorphism group of an infinite tree. Mat. Zametki, 64(4):592–597, 1998.Google Scholar

Sapir, M. Asymptotic invariants, complexity of groups and related problems. Bull. Math. Sci., 1(2):277–364, 2011.Google Scholar

Savchuk, D. and Vorobets, Y. Automata generating free products of groups of order 2. J. Algebra, 336:53–66, 2011.Google Scholar

Schreier, O. Die Untergruppen der freien Gruppen. Abh. Math. Sem. Univ. Hamburg, 5:161–183, 1927.Google Scholar

Schupp., P.E. On Dehn's algorithm and the conjugacy problem. Math. Ann., 178:119–130, 1968.Google Scholar

Schützenberger, M.P. On finite monoids having only trivial subgroups. Information and Control, 8:190–194, 1965.Google Scholar

Scott., E.A. The embedding of certain linear and abelian groups in finitely presented simple groups. J. Algebra, 90(2):323–332, 1984.Google Scholar

Segal, D. Decidability properties of polycyclic groups. Proc. London Math. Soc. (3), 61:497–528, 1990.Google Scholar

Segal, D. The finite images of finitely generated groups. Proc. London Math. Soc. (3), 82(3):597–613, 2001.Google Scholar

Sela, Z. The isomorphism problem for hyperbolic groups. Ann. of Math. (2), 141:217–283, 1995.Google Scholar

Shapiro, M. A note on context-sensitive languages and word problems. Internat. J. Algebra Comput., 4:493–497, 1994.Google Scholar

Short, H. Groups and combings, 1990. https://www.i2m.univ-amu.fr/short/Papers/bicomball.pdf.

Sidki, S. Automorphisms of one-rooted trees: growth, circuit structure, and acyclicity. J. Math. Sci. (New York), 100(1):1925–1943, 2000. Algebra, 12.Google Scholar

Sidki, S. Finite automata of polynomial growth do not generate a free group. Geom. Dedicata, 108:193–204, 2004.Google Scholar

Said, Sidki. Regular trees and their automorphisms, volume 56 of Monografías de Matemática [Mathematical Monographs]. Instituto de Matemática Pura e Aplicada (IMPA), Rio de Janeiro, 1998.

Charles, C. Sims. Computation with Finitely Presented Groups. Cambridge University Press, 1994.

John, Stallings. Group Theory and Three-Dimensional Manifolds, volume 4 of Yale Mathematical Monographs. Yale University Press, 1971.

Steinberg, B. Vorobets, M. and Vorobets., Y. Automata over a binary alphabet generating free groups of even rank. Internat. J. Algebra Comput., 21(1-2):329–354, 2011.Google Scholar

Strebel, R. Small cancellation groups. In Ghys and de la Harpe [94], pages 215–259.

Šunić, Z. and Ventura, E. The conjugacy problem in automaton groups is not solvable. J. Algebra, 364:148–154, 2012.Google Scholar

Suščanstkiĭ, V.Ī. Periodic p-groups of permutations and the unrestricted Burnside problem. Dokl. Akad. Nauk SSSR, 247(3):557–561, 1979. English translation: Soviet Math. Dokl. 20 (1979), no. 4, 766770.Google Scholar

Tits, J. Le problème des mots dans les groupes de Coxeter. In Symposia Matematica (INDAM Rome 1967/68), volume 1, pages 178–185. Academic Press, London, 1969.

van der Lek, H. The homotopy type of complex hyperplane complements. PhD thesis, University of Nijmegen, 1983.

Vorobets, M. and Vorobets, Y. On a free group of transformations defined by an automaton. Geom. Dedicata, 124:237–249, 2007.Google Scholar

Vorobets, M. and Vorobets, Y. On a series of finite automata defining free transformation groups. Groups Geom. Dyn., 4(2):377–405, 2010.Google Scholar

Wikipedia. Geometrization conjecture. https://en.wikipedia.org/wiki/Geometrization_conjecture.

Wilkie, A.J. and van den Dries, L. An effective bound for groups of linear growth. Arch. Math. (Basel), 42:391–396, 1984.Google Scholar

Williams, A. MAF (Monoid Automata Factory), 2009. http://maffsa.sourceforge.net/.Google Scholar

Wilson., J.S. Groups with every proper quotient finite. Proc. Cambridge Philos. Soc., 69:373–391, 1971.Google Scholar

Wilson., J.S. On just infinite abstract and profinite groups. In du Sautoy, M. Segal, D. and Shalev, A. editors, New horizons in pro-p groups, volume 184 of Progr. Math., pages 181–203. Birkhäuser Boston, Boston, MA, 2000.

Wilson., J.S. Further groups that do not have uniformly exponential growth. J. Algebra, 279(1):292–301, 2004.Google Scholar

Wilson., J.S. On exponential growth and uniformly exponential growth for groups. Invent. Math., 155(2):287–303, 2004.Google Scholar

Wilson, J.S. and Zalesskii, P.A. Conjugacy separability of certain torsion groups. Arch. Math. (Basel), 68(6):441–449, 1997.Google Scholar

Yamada, H. Real-time computation and recursive functions not real-time computable. IRE Trans., EC-11:753–760, 1962.Google Scholar

Żuk, A. Automata groups. In Cortiñas, G. editor, Topics in noncommutative geometry, volume 16 of Clay Math. Proc., pages 165–196. Amer. Math. Soc., Providence, RI, 2012.Google Scholar