Solving Word Problems in Group Extensions over Infinite Words

  • Volker Diekert
  • Alexei G. Myasnikov
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6795)


Non-Archimedean words have been introduced as a new type of infinite words which can be investigated through classical methods in combinatorics on words due to a length function. The length function, however, takes values in the additive group of polynomials ℤ[t] (and not, as traditionally, in ℕ), which yields various new properties. Non-Archimedean words allow to solve a number of algorithmic problems in geometric and algorithmic group theory. There is a connection to the first-order theory in free groups (Tarski Problems), too.

In the present paper we provide a general method to use infinite words over a discretely ordered abelian group as a tool to investigate certain group extensions for an arbitrary group G. The central object is a group E(A,G) which is defined in terms of a non-terminating, but confluent rewriting system. The group G as well as some natural HNN-extensions of G embed into E(A,G) (and still ”behave like” G), which makes it interesting to study its algorithmic properties. The main result characterizes when the Word Problem (WP ) is decidable in all finitely generated subgroups of E(A,G). We show that this property holds if and only if the Cyclic Membership Problem ”\(u \in \left< \mathinner{v} \right>\)?” is decidable for all v ∈ G. Our methods combine combinatorics on words, string rewriting, and group theory.


Abelian Group Word Problem Length Function Group Extension Hyperbolic Group 
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. 1.
    Bedon, N., Bès, A., Carton, O., Rispal, C.: Logic and rational languages of words indexed by linear orderings. Theory Comput. Syst. 46(4), 737–760 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Bedon, N., Rispal, C.: Schützenberger and eilenberg theorems for words on linear orderings. In: De Felice, C., Restivo, A. (eds.) DLT 2005. LNCS, vol. 3572, pp. 134–145. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  3. 3.
    Berstel, J., Perrin, D.: The origins of combinatorics on words. Eur. J. Comb. 28(3), 996–1022 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Bogopolski, O., Zastrow, A.: The word problem for some uncountable groups given by countable words. ArXiv e-prints (March 2011)Google Scholar
  5. 5.
    Book, R., Otto, F.: Confluent String Rewriting. Springer, Heidelberg (1993)CrossRefzbMATHGoogle Scholar
  6. 6.
    Chiswell, I.: Introduction to Λ-trees. World Scientific, Singapore (2001)CrossRefzbMATHGoogle Scholar
  7. 7.
    Choffrut, C., Karhumäki, J.: Combinatorics of words. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1, pp. 329–438. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  8. 8.
    Diekert, V., Duncan, A.J., Myasnikov, A.G.: Geodesic rewriting systems and pregroups. In: Bogopolski, O., Bumagin, I., Kharlampovich, O., Ventura, E. (eds.) Combinatorial and Geometric Group Theory. Trends in Mathematics, pp. 55–91. Birkhäuser, Basel (2010)CrossRefGoogle Scholar
  9. 9.
    Diekert, V., Myasnikov, A.G.: Group extensions over infinite words. ArXiv e-prints (November 2010)Google Scholar
  10. 10.
    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, Boston (1992)zbMATHGoogle Scholar
  11. 11.
    Ésik, Z., Bloom, S.L.: Algebraic linear orderings. International Journal of Foundations of Computer Science (2011)Google Scholar
  12. 12.
    Kharlampovich, O., Myasnikov, A.: Elementary theory of free non-abelian groups. J. of Algebra 302, 451–552 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Lothaire, M.: Combinatorics on Words. Encyclopedia of Mathematics and its Applications, vol. 17. Addison-Wesley, Reading (1983) (reprinted by Cambridge University Press, 1997)zbMATHGoogle Scholar
  14. 14.
    Lyndon, R., Schupp, P.: Combinatorial Group Theory. Classics in Mathematics. Springer, Heidelberg (2001)Google Scholar
  15. 15.
    Lysenok, I.: On some algorithmic problems of hyperbolic groups. Math. USSR Izvestiya 35, 145–163 (1990)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Mihailova, K.A.: The occurrence problem for direct products of groups. Dokl. Akad. Nauk SSSR 119, 1103–1105 (1958); english translation in: Math. USSR Sbornik, 70, 241–251 (1966)Google Scholar
  17. 17.
    Myasnikov, A., Remeslennikov, V., Serbin, D.: Regular free length functions on Lyndon’s free ℤ[t]-group F ℤ[t]. Contemp. Math. Amer. Math. Soc. 378, 37–77 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Olshanskii, A.Y., Sapir, M.V.: Length functions on subgroups in finitely presented groups. In: Groups — Korea 1998 (Pusan), de Gruyter, Berlin (2000)Google Scholar
  19. 19.
    Rips, E.: Subgroups of small cancellation groups. Bull. London Math. Soc. 14, 45–47 (1982)MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Romanovskii, N.S.: The occurrence problem for extensions of abelian by nilpotent groups. Sib. Math. J. 21, 170–174 (1980)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Volker Diekert
    • 1
  • Alexei G. Myasnikov
    • 2
  1. 1.FMI, Universität StuttgartStuttgartGermany
  2. 2.Department of MathematicsStevens Institute of TechnologyHobokenUSA

Personalised recommendations