-systems of unary algebras. II: Maximal and minimal subalgebras of the direct products of unary algebras
Rational strong codes and structure of rational group languages.
Rational tree morphisms and transducer integer sequences: definition and examples.
Recognizable filters and ideals
Recognizable languages and congruences.
Recognizable sets and power sets of finite semigroups.
Reconnaisseurs pour les sous-monoïdes libres
Reduction algorithms for some classes of aperiodic monoids
Regular languages definable by Lindström quantifiers
In our main result, we establish a formal connection between Lindström quantifiers with respect to regular languages and the double semidirect product of finite monoids with a distinguished set of generators. We use this correspondence to characterize the expressive power of Lindström quantifiers associated with a class of regular languages.
Regular languages definable by Lindström quantifiers
In our main result, we establish a formal connection between Lindström quantifiers with respect to regular languages and the double semidirect product of finite monoids with a distinguished set of generators. We use this correspondence to characterize the expressive power of Lindström quantifiers associated with a class of regular languages.
Regular prefix-codes and right power-bounded languages.
Reidemeister- Schreier type rewriting for semigroups.
Relational morphisms and operations on recognizable sets
Relatively f-disjunctive languages.
Right k-dense languages.