Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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)
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)
Berstel, J., Perrin, D.: The origins of combinatorics on words. Eur. J. Comb. 28(3), 996–1022 (2007)
Bogopolski, O., Zastrow, A.: The word problem for some uncountable groups given by countable words. ArXiv e-prints (March 2011)
Book, R., Otto, F.: Confluent String Rewriting. Springer, Heidelberg (1993)
Chiswell, I.: Introduction to Λ-trees. World Scientific, Singapore (2001)
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)
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)
Diekert, V., Myasnikov, A.G.: Group extensions over infinite words. ArXiv e-prints (November 2010)
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)
Ésik, Z., Bloom, S.L.: Algebraic linear orderings. International Journal of Foundations of Computer Science (2011)
Kharlampovich, O., Myasnikov, A.: Elementary theory of free non-abelian groups. J. of Algebra 302, 451–552 (2006)
Lothaire, M.: Combinatorics on Words. Encyclopedia of Mathematics and its Applications, vol. 17. Addison-Wesley, Reading (1983) (reprinted by Cambridge University Press, 1997)
Lyndon, R., Schupp, P.: Combinatorial Group Theory. Classics in Mathematics. Springer, Heidelberg (2001)
Lysenok, I.: On some algorithmic problems of hyperbolic groups. Math. USSR Izvestiya 35, 145–163 (1990)
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)
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)
Olshanskii, A.Y., Sapir, M.V.: Length functions on subgroups in finitely presented groups. In: Groups — Korea 1998 (Pusan), de Gruyter, Berlin (2000)
Rips, E.: Subgroups of small cancellation groups. Bull. London Math. Soc. 14, 45–47 (1982)
Romanovskii, N.S.: The occurrence problem for extensions of abelian by nilpotent groups. Sib. Math. J. 21, 170–174 (1980)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Diekert, V., Myasnikov, A.G. (2011). Solving Word Problems in Group Extensions over Infinite Words. In: Mauri, G., Leporati, A. (eds) Developments in Language Theory. DLT 2011. Lecture Notes in Computer Science, vol 6795. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22321-1_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-22321-1_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22320-4
Online ISBN: 978-3-642-22321-1
eBook Packages: Computer ScienceComputer Science (R0)