Abstract
The notion of the word problem is of fundamental importance in group theory. The irreducible word problem is a closely related concept and has been studied in a number of situations; however there appears to be little known in the case where a finitely generated group has a recursively enumerable irreducible word problem. In this paper we show that having a recursively enumerable irreducible word problem with respect to every finite generating set is equivalent to having a recursive word problem. We prove some further results about groups having a recursively enumerable irreducible word problem, amongst other things showing that there are cases where having such an irreducible word problem does depend on the choice of finite generating set.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anisimov, A.V.: Group languages. Kibernetika 4, 18–24 (1971)
Boone, W.W.: The word problem. An. of Math. 70, 207–265 (1959)
Boone, W.W., Higman, G.: An algebraic characterization of groups with a solvable word problem. J. Austral. Math. Soc. 18, 41–53 (1974)
Dunwoody, M.J.: The accessibility of finitely presented groups. Invent. Math. 81, 449–457 (1985)
Fonseca, A.R.: Formal languages and the irreducible word problem in groups. PhD thesis, University of Leicester (2005)
Fonseca, A.R., Parkes, D.W., Thomas, R.M.: Irreducible word problems in groups. In: Campbell, C.M., Quick, M.R., Robertson, E.F., Smith, G.C. (eds.) Groups St Andrews 2005. LMS Lecture Notes Series 339, CUP, vol. 1, pp. 327–340 (2007)
Fonseca, A.R., Thomas, R.M.: Context-free irreducible word problems in groups. In: Fine, B., Gaglione, A.M., Spellman, D. (eds.) Combinatorial Group Theory, Discrete Groups, and Number Theory. Contemporary Mathematics 421, pp. 125–136. American Mathematical Society (2006)
Haring-Smith, R.H.: Groups and simple languages. Trans. Amer. Math. Soc. 279, 337–356 (1983)
Herbst, T., Thomas, R.M.: Group presentations, formal languages and characterizations of one-counter groups. Theoret. Comp. Sci. 112, 187–213 (1993)
Higman, G.: Subgroups of finitely presented groups. R. Soc. Lond. Philos. Trans. Ser. A Math. Phys. Eng. Sci. 262, 455–475 (1961)
Ito, M., Kari, L., Thierrin, G.: Insertion and deletion closure of languages. Theoret. Comp. Sci. 183, 3–19 (1997)
Lakin, S.R., Thomas, R.M.: Context-sensitive decision problems in groups. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol. 3340, pp. 296–307. Springer, Heidelberg (2004)
Lyndon, R.C., Schupp, P.E.: Combinatorial group theory. In: Ergebnisse der Mathematik und ihrer Grenzgebiete. Springer (1977)
Madlener, K., Otto, F.: About the descriptive power of certain classes of finite string-rewriting systems. Theoret. Comp. Sci. 67, 143–172 (1989)
Muller, D., Schupp, P.: Groups, the theory of ends, and context-free languages. J. Comput. System Sci. 26, 295–310 (1983)
Novikov, P.S.: On the algorithmic unsolvability of the word problem in group theory. Trudy. Mat. Inst. Steklov 44, 1–143 (1955)
Parkes, D.W., Shavrukov, V.Y., Thomas, R.M.: Monoid presentations of groups by finite special string-rewriting systems. Theor. Inform. Appl. 38, 245–256 (2004)
Parkes, D.W., Thomas, R.M.: Groups with context-free reduced word problem. Comm. Algebra 30, 3143–3156 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rino Nesin, G.A., Thomas, R.M. (2013). Groups with a Recursively Enumerable Irreducible Word Problem. In: Gąsieniec, L., Wolter, F. (eds) Fundamentals of Computation Theory. FCT 2013. Lecture Notes in Computer Science, vol 8070. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40164-0_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-40164-0_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40163-3
Online ISBN: 978-3-642-40164-0
eBook Packages: Computer ScienceComputer Science (R0)