Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Descriptional Complexity of Formal Systems

DCFS 2012: Descriptional Complexity of Formal Systems pp 50–63Cite as

Groups and Automata: A Perfect Match

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7386))

Abstract

We present a personal perspective, inspired by our own research experience, of the interaction between group theory and automata theory: from Benois’ Theorem to Stallings’ automata, from hyperbolic to automatic groups, not forgetting the exotic automaton groups.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aleshin, S.V.: Finite automata and the burnside problem for periodic groups. Mat. Zametki 11, 319–328 (1972) (Russian)

    MathSciNet  MATH  Google Scholar 

  2. Alonso, J., Brady, T., Cooper, D., Ferlini, V., Lustig, M.M., Shapiro, M., Short, H.: Notes on word-hyperbolic groups. In: Ghys, E., Haefliger, A., Verjovsky, A. (eds.) Proc. Conf. Group Theory from a Geometrical Viewpoint. World Scientific, Singapore (1991)

    Google Scholar 

  3. Bartholdi, L., Grigorchuk, R.I., Nekrashevych, V.V.: From fractal groups to fractal sets. In: Fractals in Graz 2001, trends math. edn., pp. 25–118. Birkhauser, Basel (2003)

    Google Scholar 

  4. Bartholdi, L., Silva, P.V.: Groups defined by automata. In: Handbook AutoMathA, ch. 24 (2010) (to appear)

    Google Scholar 

  5. Bartholdi, L., Silva, P.V.: Rational subsets of groups. In: Handbook AutoMathA, ch. 23 (2010) (to appear)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  7. Benois, M.: Parties rationnelles du groupe libre. C. R. Acad. Sci. Paris 269, 1188–1190 (1969)

    MathSciNet  MATH  Google Scholar 

  8. Berstel, J.: Transductions and Context-free Languages. Teubner, Stuttgart (1979)

    MATH  Google Scholar 

  9. Book, R.V., Otto, F.: String-Rewriting Systems. Springer, New York (1993)

    MATH  Google Scholar 

  10. Dunwoody, M.J.: The accessibility of finitely presented groups. Invent. Math. 81.3, 449–457 (1985)

    Article  MathSciNet  Google Scholar 

  11. 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)

    MATH  Google Scholar 

  12. Ghys, E., de la Harpe, P. (eds.): Sur les Groupes Hyperboliques d’après Mikhael Gromov. Birkhauser, Boston (1990)

    MATH  Google Scholar 

  13. Gilman, R.H.: On the definition of word hyperbolic groups. Math. Z. 242(3), 529–541 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  14. Gilman, R.H., Hermiller, S., Holt, D.F., Rees, S.: A characterization of virtually free groups. Arch. Math. 89, 289–295 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  15. Glushkov, V.M.: Abstract theory of automata. Uspehi Mat. Nauk. 16(5), 3–62 (1961) (Russian)

    MathSciNet  Google Scholar 

  16. Goldstein, R.Z., Turner, E.C.: Fixed subgroups of homomorphisms of free groups. Bull. London Math. Soc. 18, 468–470 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  17. Grigorchuk, R., Zuk, A.: The lamplighter group as a group generated by a 2-state automaton. Geom. Dedicata 87(1-3), 209–244 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  18. Grigorchuk, R.I.: On burnside’s problem on periodic groups. Funktsional. Anal. i Prilozhen 14(1), 53–54 (1980) (Russian)

    MathSciNet  Google Scholar 

  19. Grigorchuk, R.I., Zuk, A.: On a torsion-free weakly branch group defined by a three state automaton. Internat. J. Algebra Comput. 12(1&2), 223–246 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  20. Gromov, M.L.: Hyperbolic groups. In: Essays in Group Theory. Math. Sci. Res. Inst. Publ., vol. 8, pp. 75–263. Springer, New York (1987)

    Chapter  Google Scholar 

  21. Grunschlag, Z.: Algorithms in geometric group theory. Ph.d. thesis, University of California at Berkeley (1999)

    Google Scholar 

  22. Gupta, N.D., Sidki, S.N.: Some infinite p-groups. Algebra i Logika 22(5), 584–589 (1983) (English, with Russian summary)

    Article  MathSciNet  Google Scholar 

  23. Kambites, M., Silva, P.V., Steinberg, B.: The spectra of lamplighter groups and cayley machines. Geometriae Dedicata 120(1), 193–227 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  24. Kapovich, I., Miasnikov, A.: Stallings foldings and subgroups of free groups. J. Algebra 248, 608–668 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  25. Kapovich, I., Weidmann, R., Miasnikov, A.: Foldings, graphs of groups and the membership problem. Internat. J. Algebra Comput. (2005)

    Google Scholar 

  26. Lohrey, M., Steinberg, B.: The submonoid and rational subset membership problems for graph groups. J. Algebra 320(2), 728–755 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  27. Lyndon, R.C., Schupp, P.E.: Combinatorial Group Theory. Springer (1977)

    Google Scholar 

  28. Markus-Epstein, L.: Stallings foldings and subgroups of amalgams of finite groups. Internat. J. Algebra Comput. 17(8), 1493–1535 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  29. Miasnikov, A., Ventura, E., Weil, P.: Algebraic extensions in free groups. In: Geometric Group Theory. Trends Math., pp. 225–253. Birkhäuser, Basel (2007)

    Chapter  Google Scholar 

  30. Muller, D.E., Schupp, P.E.: Groups, the theory of ends, and context-free languages. J. Comput. System Sci. 26(3), 295–310 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  31. Nekrashevych, V.: Self-similar groups. In: Mathematical Surveys and Monographs, vol. 117. Amer. Math. Soc., Providence (2005)

    Google Scholar 

  32. Sakarovitch, J.: A problem on rational subsets of the free group. Amer. Math. Monthly 91, 499–501 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  33. Sénizergues, G.: Some decision problems about controlled rewriting systems. Theoret. Comput. Sci. 71(3), 281–346 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  34. Sénizergues, G.: On the rational subsets of the free group. Acta Informatica 33(3), 281–296 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  35. Serre, J.P.: Arbres, amalgames, sl 2. In: Astérisque 46. Soc. Math., France (1977); english translation: Trees. Springer Monographs in Mathematics. Springer (2003)

    Google Scholar 

  36. Silva, P.V.: Free group languages: rational versus recognizable. Theoret. Informatics and Appl. 38, 49–67 (2004)

    Article  MATH  Google Scholar 

  37. Silva, P.V.: Rational subsets of partially reversible monoids. Theor. Comp. Science 409(3), 537–548 (2008)

    Article  MATH  Google Scholar 

  38. Silva, P.V.: Fixed points of endomorphisms of virtually free groups. Tech. Rep. preprint 2012-10, CMUP (2012), arXiv:1203.1355

    Google Scholar 

  39. Silva, P.V., Soler-Escrivà, X., Ventura, E.: Finite automata for schreier graphs of virtually free groups. Tech. Rep. preprint 2012-2, CMUP (2012), arXiv:1112.5709

    Google Scholar 

  40. Silva, P.V., Steinberg, B.: On a class of automata groups generalizing lamplighter groups. Int. J. Alg. Comput. 15(5/6), 1213–1234 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  41. Stallings, J.: Topology of finite graphs. Invent. Math. 71, 551–565 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  42. Stephen, J.B.: Presentations of inverse monoids. J. Pure Appl. Algebra 63, 81–112 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  43. Sykiotis, M.: Fixed points of symmetric endomorphisms of groups. Internat. J. Algebra Comput. 12(5), 737–745 (2002)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centro de Matemática, Faculdade de Ciências, Universidade do Porto, R. Campo Alegre 687, 4169-007, Porto, Portugal

    Pedro V. Silva

Authors
  1. Pedro V. Silva
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Universität Giessen, Arndtstraße 2, 35392, Giessen, Germany

    Martin Kutrib

  2. Departamento de Ciência de Computadores, Universidade do Porto, Faculdade de Ciências, Rua do Campo Alegre 1021-1055, 4169-007, Porto, Portugal

    Nelma Moreira  & Rogério Reis  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Silva, P.V. (2012). Groups and Automata: A Perfect Match. In: Kutrib, M., Moreira, N., Reis, R. (eds) Descriptional Complexity of Formal Systems. DCFS 2012. Lecture Notes in Computer Science, vol 7386. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31623-4_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31623-4_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31622-7

  • Online ISBN: 978-3-642-31623-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation