Cyclically regular semigroups
Stanislav Kublanovsky
TL;DR
This paper explores specific varieties of semigroups connected to completely 0-simple semigroups, providing an algorithmic way to describe these varieties using forbidden semigroups.
Contribution
It introduces an algorithmic method to characterize varieties of semigroups related to completely 0-simple semigroups through forbidden semigroups.
Findings
Algorithmic descriptions of semigroup varieties
Characterization of varieties via forbidden semigroups
Connections to completely 0-simple semigroups
Abstract
We study varieties of semigroups related to completely 0-simple semigroup. We present here an algorithmic descriptions of these varieties interms of "forbidden" semigroups.
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 · Optimization and Search Problems · Fuzzy and Soft Set Theory