This is a report on the organizational meeting of a seminar on automatic groups which took place at MSRI on 17 January 1989. Although the intention was merely to establish a time and a first speaker, Bill Thurston soon took the floor and one after another of the participants proposed questions on automatic groups, none of which could be answered at that time. It seemed worthwhile to record those questions asked as a guide to research into automatic groups. Participants proposing questions were Thurston, G. Baumslag, M. Shapiro, H. Short, and the author. We have not attempted to record who proposed what problem. After a draft of this note was sent to David Epstein, he proposed some problems he thought ought to be included. Geoff Mess also contributed suggestions after the first draft was circulated. He remarked that a notion of automatic groups was considered by Russian writers in the 1970’s; it is important to point out that this earlier notion has nothing to do with the notion introduced in [CEHPT], which is the subject of this problem set.


Cayley Graph Isoperimetric Inequality Finite Index Regular Language Finite State Automaton 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Al]
    J. Alonso, Combings of Groups, MSRI preprint 04623–89, 1989.Google Scholar
  2. [ABC]
    J. Alonso, T. Brady, D. Cooper, T. Delzant, V. Ferlini, M. Lustig, M. Mihalik, M. Shapiro, and H. Short, Notes on negatively curved groups, MSRI preprint 1989.Google Scholar
  3. BGSS] G. Baumslag, S.M. Gersten, M. Shapiro, and H. Short, Automatic groups and amalgams, —a summary appears in this volume.Google Scholar
  4. [Bo]
    B. Bowditch, Notes on Gromov’s hyperbolicity criterion for path-metric spaces, preprint, University of Warwick, 1989.Google Scholar
  5. [Ca]
    J.W. Cannon, The combinatorial structure of cocompact discrete hyperbolic groups, Geometriae Dedicata 16 (1984), 123–148.CrossRefMATHMathSciNetGoogle Scholar
  6. [Ca2]
    J.W. Cannon, Negatively curved spaces and groups, Prelilminary lecture notes from the ‘Topical Meeting on Hyperbolic Geometry and Ergodic Theory’, Trieste, April 1989.Google Scholar
  7. [Co]
    D. Cooper, Automorphisms of negatively curved groups, preprint, University of California at Santa Barbara, 1989.Google Scholar
  8. [GDP]
    M. Coornaert, T. Delzant, and A. Papadopoulos, Notes sur les groupes hyperboliques de Gromov, IRMA Strasbourg, 1989.Google Scholar
  9. [CEHPT]
    J.W. Cannon, D.B.A. Epstein, D.F. Holt, M.S. Paterson and W.P. Thurston, Word processing and group theory, preprint, University of Warwick, obtainable by writing D. B. A. Epstein.Google Scholar
  10. [Ep]
    D.B.A. Epstein, Computers, groups and hyperbolic geometry, Astérisque 163–164 (1988), 9–29.Google Scholar
  11. [Ge]
    S.M. Gersten, Dehn functions and ll-norms of finite presentations, these proceedings.Google Scholar
  12. [GH]
    W. Ballmann, E. Ghys, A. Haefliger, P. de la Harpe, E. Salem, R. Strebel, and M. Troyanov, “Sur les groupes hyperboliques d’après Mikhael Gromov,” edited by E. Ghys and P. de la Harpe, Birkhäuser, Progress in Mathematics Series, 1990.Google Scholar
  13. [Gi]
    R. H. Gilman, Groups with a rational cross-section, in “Combinatorial Group Theory and Topology,” editors S. M. Gersten and John Stallings, Annals of Math. Study 111, Princeton Univ. Press, 1986, pp. 175–183.Google Scholar
  14. [Gr]
    M. Gromov, Hyperbolic groups, in “Essays in Group Theory,” MSRI series Vol. 8, S.M. Gersten, editor, Springer-Verlag, 1987.Google Scholar
  15. [GSh]
    S. M. Gersten and H. Short, Small cancellation theory and automatic groups, Invent. Math. 102 (1990), 305–334.CrossRefMATHMathSciNetGoogle Scholar
  16. [GSh2]
    S. M. Gersten and H. Short, Small cancellation theory and automatic groups, part II, Invent. Math. (to appear).Google Scholar
  17. [GSh3]
    S. M. Gersten and H. Short, Rational subgroups of biautomatic groups, MSRI preprint #07923–89, 1989, to appear in Annals of Math.Google Scholar
  18. [GSt]
    S.M. Gersten and John Stallings, A note on irreducible outer automorphisms of a free group, preprint 1989.Google Scholar
  19. [HU]
    J. E. Hoperoft and J. D. Ullman, “Introduction to Automata Theory, Languages, and Computation,” Addison-Wesley, 1979.Google Scholar
  20. [LS]
    R.C. Lyndon and P.E. Schupp, “Combinatorial Group Theory,” Springer-Verlag, 1977.MATHGoogle Scholar
  21. [Pa]
    F. Paulin, Points fixes d’automorphisms de groups hyperboliques, Ann. Inst. Fourier, Grenoble 393 (1989), 651–662.CrossRefMathSciNetGoogle Scholar
  22. [RS]
    M. Rabin and D. Scott, Finite automata and their decision problems, IBM Jour. Res. 3:2 (1959), 115–125.MathSciNetGoogle Scholar
  23. [Sh]
    H. Short, Regular subgroups of automatic groups, MSRI preprint #07723–89, 1989.Google Scholar
  24. [Th]
    W. P. Thurston, Finite state algorithms for the braid groups, preprint, Princeton University, February 1989.Google Scholar

Copyright information

© Springer-Verlag New York, Inc. 1992

Authors and Affiliations

  • S. M. Gersten
    • 1
  1. 1.Mathematics DepartmentUniversity of UtahSalt Lake CityUSA

Personalised recommendations