Abstract
The word problem is of fundamental interest in group theory and has been widely studied. One important connection between group theory and theoretical computer science has been the consideration of the word problem as a formal language; a pivotal result here is the classification by Muller and Schupp of groups with a context-free word problem. Duncan and Gilman have proposed a natural extension of the notion of the word problem as a formal language from groups to semigroups and the question as to which semigroups have a context-free word problem then arises. Whilst the depth of the Muller-Schupp result and its reliance on the geometrical structure of Cayley graphs of groups suggests that a generalization to semigroups could be very hard to obtain we have been able to prove some results about this intriguing class of semigroups.
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
Anīsīmov, A.V.: Certain algorithmic questions for groups and context-free languages. Kibernetika (Kiev) (2), 4–11 (1972)
Autebert, J.-M., Boasson, L., Sénizergues, G.: Groups and NTS languages. J. Comput. System Sci. 35(2), 243–267 (1987)
Ayik, H., Rus̆kuc, N.: Generators and relations of Rees matrix semigroups. Proc. Edinburgh Math. Soc. (2) 42(3), 481–495 (1999)
Berstel, J.: Transductions and context-free languages. Leitfäden der Angewandten Mathematik und Mechanik, vol. 38. B. G. Teubner, Stuttgart (1979)
Clifford, A.H., Preston, G.B.: The algebraic theory of semigroups.Vol. I. Mathematical Surveys, vol. 7. American Mathematical Society, Providence (1961)
Clifford, A.H., Preston, G.B.: The algebraic theory of semigroups. Vol. II. Mathematical Surveys, vol. 7. American Mathematical Society, Providence (1967)
Duncan, A., Gilman, R.H.: Word hyperbolic semigroups. Math. Proc. Cambridge Philos. Soc. 136(3), 513–524 (2004)
Dunwoody, M.J.: The accessibility of finitely presented groups. Invent. Math. 81(3), 449–457 (1985)
Ginsburg, S.: The mathematical theory of context-free languages. McGraw-Hill Book Co., New York (1966)
Harrison, M.A.: Introduction to formal language theory. Addison-Wesley Publishing Co., Reading (1978)
Herbst, T.: On a subclass of context-free groups. RAIRO Inform. Théor. Appl. 25(3), 255–272 (1991)
Herbst, T., Thomas, R.M.: Group presentations, formal languages and characterizations of one-counter groups. Theoret. Comput. Sci. 112(2), 187–213 (1993)
Hoffmann, M., Kuske, D., Otto, F., Thomas, R.M.: Some relatives of automatic and hyperbolic groups. In: Semigroups, Algorithms, Automata and Languages (Coimbra, 2001), pp. 379–406. World Sci. Publ., River Edge (2002)
Holt, D.F., Owens, M.D., Thomas, R.M.: Groups and semigroups with a one-counter word problem. J. Aust. Math. Soc. 85(2), 197–209 (2008)
Holt, D.F., Rees, S., Röver, C.E., Thomas, R.M.: Groups with context-free co-word problem. J. London Math. Soc. (2) 71(3), 643–657 (2005)
Hopcroft, J.E., Ullman, J.D.: Introduction to automata theory, languages, and computation. Addison-Wesley Publishing Co., Reading (1979)
Howie, J.M.: Fundamentals of semigroup theory. London Mathematical Society Monographs. New Series, vol. 12. The Clarendon Press, Oxford University Press, New York (1995)
Jura, A.: Determining ideals of a given finite index in a finitely presented semigroup. Demonstratio Math. 11(3), 813–827 (1978)
Lallement, G.: Semigroups and combinatorial applications. John Wiley & Sons, New York (1979)
Muller, D.E., Schupp, P.E.: Groups, the theory of ends, and context-free languages. J. Comput. System Sci. 26(3), 295–310 (1983)
Pelletier, M., Sakarovitch, J.: Easy multiplications. II. Extensions of rational semigroups. Inform. and Comput. 88(1), 18–59 (1990)
Rosenberg, A.L.: A machine realization of the linear context-free languages. Information and Control 10(2), 175–188 (1967)
Sakarovitch, J.: Easy multiplications. I. The realm of Kleene’s theorem. Inform. and Comput. 74(3), 173–197 (1987)
Stallings, J.: Group theory and three-dimensional manifolds. Yale University Press, New Haven (1971)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hoffmann, M., Holt, D.F., Owens, M.D., Thomas, R.M. (2012). Semigroups with a Context-Free Word Problem. In: Yen, HC., Ibarra, O.H. (eds) Developments in Language Theory. DLT 2012. Lecture Notes in Computer Science, vol 7410. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31653-1_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-31653-1_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31652-4
Online ISBN: 978-3-642-31653-1
eBook Packages: Computer ScienceComputer Science (R0)