Recognizable filters and ideals
Recognizable languages and congruences.
RECOGNIZABLE LANGUAGES AND FINITE SEMILATTICES OF GROUPS.
Recognizable sets and power sets of finite semigroups.
Reconnaisseurs pour les sous-monoïdes libres
Reconstructing some idempotent-generated semigroups from their biordered sets.
Reduced commutative monoids with two Archimedean components
Si studiano i monoidi commutativi ridotti con due componenti archimedee e si forniscono dei teoremi di strutture. Si presta particolare attenzione a quei monoidi che sono finitamente generati, e si danno degli algoritmi che permettono di ottenere informazioni a partire da un delle loro presentazioni.
Reduced inverse semigroups.
Reduction algorithms for some classes of aperiodic monoids
Reductive groups and regular semigroups.
Rees quotients of N-semigroups.
Refinement Monoids, Vaught Monoids, and Boolean Algebras.
Reg-strongly solid varieties of commutative semigroups
Regular 4-spiral semigroup, I.G. semigroups and the Rees construction.
Regular and simple Schur-semigroups.
Regular ....-classes of semigroups of continua.
Regular elements of the semigroup of all binary relations.
Regular generalized adjoint semigroups of a ring.
Regular, inverse, and completely regular centralizers of permutations
For an arbitrary permutation in the semigroup of full transformations on a set with elements, the regular elements of the centralizer of in are characterized and criteria are given for to be a regular semigroup, an inverse semigroup, and a completely regular semigroup.
Regular involution groupoids revisited.