Rational strong codes and structure of rational group languages.
RECOGNIZABLE LANGUAGES AND FINITE SEMILATTICES OF GROUPS.
Recognizable sets and power sets of finite semigroups.
Reconnaisseurs pour les sous-monoïdes libres
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.
Reduction algorithms for some classes of aperiodic monoids
Regular elements of the semigroup of all binary relations.
Regular monoids generated by two Galois connections.
Reidemeister- Schreier type rewriting for semigroups.
Relatively f-disjunctive languages.
Relatively free *-bands.
Remark on one-sided -ideals of semigroups
Remark on partially ordered sets, universal algebras and semigroups
Residual finiteness in completely regular semigroup varieties.
Residual finiteness in permutation varieties of semigroups.
Residual finiteness of a class of semigroups presented by a single relation.
Resolutions for free partially commutative monoids.
Retracts of free monoids are nowhere dense with respect to finite group topologies and p-adic topologies.
Right k-dense languages.