Regular semigroups weakly generated by idempotents
Lu\'is Oliveira

TL;DR
This paper constructs a universal regular semigroup weakly generated by a set of idempotents, demonstrating its structure, decidability of the word problem, and its role as a dividing semigroup for all finite semigroups.
Contribution
It introduces the semigroup FI(X) as a universal object for regular semigroups weakly generated by idempotents, with a detailed structural analysis and decidability results.
Findings
FI(X) is a universal regular semigroup weakly generated by |X| idempotents.
The word problem for FI(X) is decidable despite infinite generating sets.
FI_2 contains all FI_n as subsemigroups, linking finite and infinite structures.
Abstract
A regular semigroup is weakly generated by a set X if it has no proper regular subsemigroups containing X. In this paper, we study the regular semigroups weakly generated by idempotents. We show there exists a regular semigroup FI(X) weakly generated by |X| idempotents such that all other regular semigroups weakly generated by |X| idempotents are homomorphic images of FI(X). The semigroup FI(X) is defined by a presentation and its structure is studied. Although each of the sets , , and is infinite for , we show that the word problem is decidable as each congruence class has a canonical form. If denotes FI(X) for , we prove also that contains copies of all as subsemigroups. As a consequence, we conclude that (i) all regular semigroups weakly generated by a finite set of idempotents, which…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Natural Language Processing Techniques
