Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T07:37:59.259Z Has data issue: false hasContentIssue false

The loop problem for monoids and semigroups

Published online by Cambridge University Press:  01 September 2007

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

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 2007