Advertisement

Characterizing Word Problems of Groups

  • Sam A. M. Jones
  • Richard M. ThomasEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9899)

Abstract

The word problem of a finitely generated group is a fundamental notion in group theory; it can be defined as the set of all the words in the generators of the group that represent the identity element of the group. This definition allows us to consider a word problem as a formal language and a rich topic of research concerns the connection between the complexity of this language and the algebraic structure of the corresponding group.

Another interesting problem is that of characterizing which languages are word problems of groups. There is a known necessary and sufficient criterion for a language to be a word problem of a group; however a natural question is what other characterizations there are. In this paper we investigate this question, using sentences expressed in first-order logic where the relations we consider are membership of the language in question and concatenation of words. We choose some natural conditions that apply to word problems and then characterize which sets of these conditions are sufficient to guarantee that the language in question really is the word problem of a group. We finish by investigating the decidability of these conditions for the families of regular and one-counter languages.

Keywords

Word Problem Identity Element Formal Language Regular Language Fundamental Notion 
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.

Notes

Acknowledgments

The supportive comments from the referees and their suggestions about the presentation of the material were very welcome; we are grateful to them for their careful reading of the paper.

This paper was completed whilst the second author was on study leave from the University of Leicester and he would like to acknowledge the help and support of the university in this respect. The second author would also like to thank Hilary Craig for all her help and encouragement.

References

  1. 1.
    Anisimov, V.A.: The group languages. Kibernetika 4, 18–24 (1971)MathSciNetGoogle Scholar
  2. 2.
    Berstel, J.: Transductions and Context-Free Languages. Teubner, Leipzig (1979)CrossRefzbMATHGoogle Scholar
  3. 3.
    Dunwoody, M.J.: The accessibility of finitely presented groups. Invent. Math. 81, 449–457 (1985)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Herbst, T.: On a subclass of context-free groups. RAIRO Inform. Théor. Appl. 25, 255–272 (1991)MathSciNetzbMATHGoogle Scholar
  5. 5.
    Herbst, T., Thomas, R.M.: Group presentations, formal languages and characterizations of one-counter groups. Theoret. Comput. Sci. 112, 187–213 (1993)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Holt, D.F., Owens, M.D., Thomas, R.M.: Groups and semigroups with a one-counter word problem. J. Aust. Math. Soc. 85, 197–209 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)zbMATHGoogle Scholar
  8. 8.
    Ito, M.: Algebraic Theory of Automata and Languages. World Scientific Press, Singapore (2004)CrossRefzbMATHGoogle Scholar
  9. 9.
    Johnson, D.L.: Presentations of Groups. Cambridge University Press, Cambridge (1990)zbMATHGoogle Scholar
  10. 10.
    Jones, S.A.M., Thomas, R.M.: Formal languages, word problems of groups and decidability. In: Abdulla, P.A., Potapov, I. (eds.) RP 2013. LNCS, vol. 8169, pp. 146–158. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  11. 11.
    Muller, D.E., Schupp, P.E.: Groups, the theory of ends, and context-free languages. J. Comput. Syst. Sci. 26, 295–310 (1983)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Parkes, D.W., Thomas, R.M.: Syntactic monoids and word problems. Arab. J. Sci. Eng. 25, 81–94 (2000)MathSciNetzbMATHGoogle Scholar
  13. 13.
    Parkes, D.W., Thomas, R.M.: Groups with context-free reduced word problem. Comm. Algebra 30, 3143–3156 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Rotman, J.L.: An Introduction to The Theory of Groups. Springer, Berlin (1995)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.School of Mathematics and Computer ScienceUniversity of WolverhamptonWolverhamptonUK
  2. 2.Department of Computer ScienceUniversity of LeicesterLeicesterUK

Personalised recommendations