Hostname: page-component-848d4c4894-89wxm Total loading time: 0 Render date: 2024-07-06T03:57:03.407Z Has data issue: false hasContentIssue false
  • English
  • Français

The loop problem for monoids and semigroups

Published online by Cambridge University Press:  01 September 2007

MARK KAMBITES
MARK KAMBITES*
Affiliation:
School of Mathematics, University of Manchester, Manchester M60 1QD. email: Mark.Kambites@manchester.ac.uk
Get access Rights & Permissions [Opens in a new window]

Abstract

We propose a way of associating to each finitely generated monoid or semigroup a formal language, called its loop problem. In the case of a group, the loop problem is essentially the same as the word problem in the sense of combinatorial group theory. Like the word problem for groups, the loop problem is regular if and only if the monoid is finite. We also study the case in which the loop problem is context-free, showing that a celebrated group-theoretic result of Muller and Schupp extends to describe completely simple semigroups with context-free loop problems. We consider right cancellative monoids, establishing connections between the loop problem and the structural theory of these semigroups by showing that the syntactic monoid of the loop problem is the inverse hull of the monoid.

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 143 , Issue 2 , September 2007 , pp. 271 - 289
Copyright
Copyright © Cambridge Philosophical Society 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1] A. V. Anisimov. The group languages. Kibernetika Kiev, (4), (1971), 18–24.Google Scholar
[2]Ayik, H. and Ru, N.. Generators and relations of Rees matrix semigroups. Proc. Edinburgh Math. Soc. 42 (1999), 481–495.CrossRefGoogle Scholar
[3]Berstel, J.. Transductions and Context-Free Language (Informatik, Teubner, 1979).CrossRefGoogle Scholar
[4]Boone, W. W. and Higman, G.. An algebraic characterization of groups with soluble word problem. J. Austral. Math. Soc. 18 (1974), 41–53. Collection of articles dedicated to the memory of Hanna Neumann, IX.CrossRefGoogle Scholar
[5]Campbell, C. M., Robertson, E. F., Ruskuc, N., and Thomas, R. M.. Automatic semigroups. Theoret. Comput. Sci. 250 (2001), 365–391.CrossRefGoogle Scholar
[6]Clifford, A. H. and Preston, G. B.. The Algebraic Theory of Semigroups (Volume I). (Amer. Math. Soc., 1961).Google Scholar
[7]Duncan, A. and Gilman, R. H.. Word hyperbolic semigroups. Math. Proc. Camb. Phil. Soc. 136 (3), (2004), 513–524.CrossRefGoogle Scholar
[8]Dunwoody, M. J.. The accessibility of finitely presented groups. Invent. Math. 81 (3), (1985), 449–457.CrossRefGoogle Scholar
[9]Fountain, J. B. and Kambites, M.. Hyperbolic groups and completely simple semigroups. In Semigroups and Languages (World Science Publishing, 2004), pp. 106–132.CrossRefGoogle Scholar
[10]Gilman, R. H.. On the definition of word hyperbolic groups. Math. Z. 242 (3), (2002), 529–541.CrossRefGoogle Scholar
[11]Grätzer, G.. Universal Algebra (D. Van Nostrand Co., Inc., 1968).Google Scholar
[12]Gromov, M.. Hyperbolic groups. In Essays in Group Theory, volume 8 of Math. Sci. Res. Inst. Publ. (Springer, 1987), pp. 75–263.CrossRefGoogle Scholar
[13]Higman, G.. Subgroups of finitely presented groups. Proc. Roy. Soc. Ser. A 262 (1961), 455–475.Google Scholar
[14]Hopcroft, J. E. and Ullman, J. D.. Formal Languages and their Relation to Automata (Addison-Wesley, 1969).Google Scholar
[15]Howie, J. M.. Fundamentals of Semigroup Theory (Clarendon Press, 1995).CrossRefGoogle Scholar
[16]Hudson, J. F. P.. Regular rewrite systems and automatic structures. In Almeida, J., Gomes, G., and Silva, P. V., editors, Semigroups, Automata and Languages (World Scientific, 1996), pp. 145–152.Google Scholar
[17]Kambites, M.. Formal languages and groups as memory. arXiv:math.RA/000601061, 2006.Google Scholar
[18]Lawson, M. V.. Inverse Semigroups: The Theory of Partial Symmetries (World Scientific, 1998).CrossRefGoogle Scholar
[19]Lyndon, R. C. and Schupp, P. E.. Combinatorial Group Theory (Springer-Verlag, 1977).Google Scholar
[20]Magnus, W., Karrass, A., and Solitar, D.. Combinatorial Group Theory (Dover Publications Inc., revised edition, 1976).Google Scholar
[21]Muller, D. E. and Schupp, P. E.. Groups, the theory of ends, and context-free languages. J. Comput. System Sci. 26 (3), (1983), 295–310.CrossRefGoogle Scholar
[22]Pin, J.-E.. Varieties of Formal Languages (North Oxford Academic, 1986).CrossRefGoogle Scholar
[23]Rees, D.. On semi-groups. Proc. Cam. Phi. Soc. 36 (1940), 387–400.CrossRefGoogle Scholar
[24]Rees, D.. On the group of a set of partial transformations. J. London Math. Soc. 22 (1948), 281–284.Google Scholar
[25]Stallings, J. R.. On torsion-free groups with infinitely many ends. Ann. of Math. (2) 88 (1968), 312–334.CrossRefGoogle Scholar
[26]Suschkewitz, A. K.. Über die endlichen Gruppen ohne das Gesetz der eindeutigen Umkehrbarkeit. Math. Ann. 99 (1928), 30–50.CrossRefGoogle Scholar