ﻻ يوجد ملخص باللغة العربية
This paper is a contribution to the theory of finite semigroups and their classification in pseudovarieties, which is motivated by its connections with computer science. The question addressed is what role can play the consideration of an order compatible with the semigroup operation. In the case of unions of groups, so-called completely regular semigroups, the problem of which new pseudovarieties appear in the ordered context is solved. As applications, it is shown that the lattice of pseudovarieties of ordered completely regular semigroups is modular and that taking the intersection with the pseudovariety of bands defines a complete endomorphism of the lattice of all pseudovarieties of ordered semigroups.
We give a complete characterization of pseudovarieties of semigroups whose finitely generated relatively free profinite semigroups are equidivisible. Besides the pseudovarieties of completely simple semigroups, they are precisely the pseudovarieties
This paper enriches the list of properties of the congruence sequences starting from the universal relation and successively performing the operations of lower $t$ and lower $k$. Three classes of completely regular semigroups, namely semigroups for w
Motivated by the question of which completely regular semigroups have context-free word problem, we show that for certain classes of languages $mathfrak{C}$(including context-free), every completely regular semigroup that is a union of finitely many
Several complete congruences on the lattice L(CR) of varieties of completely regular semi- groups have been fundamental to studies of the structure of L(CR). These are the kernel relation K , the left trace relation Tl , the right trace relation Tr a
The kernel relation $K$ on the lattice $mathcal{L}(mathcal{CR})$ of varieties of completely regular semigroups has been a central component in many investigations into the structure of $mathcal{L}(mathcal{CR})$. However, apart from the $K$-class of t