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.
Safety- and liveness-properties in propositional temporal logic: characterizations and decidability
Semigroups defined by automaton extension mapping
We study semigroups generated by the restrictions of automaton extension (see, e.g., [3]) and give a characterization of automaton extensions that generate finite semigroups.
Semisimplicity of the algebra associated to a biprefix code.
Solid codes and disjunctive domains.
Some Algebraic Properties of Machine Poset of Infinite Words
The complexity of infinite words is considered from the point of view of a transformation with a Mealy machine that is the simplest model of a finite automaton transducer. We are mostly interested in algebraic properties of the underlying partially ordered set. Results considered with the existence of supremum, infimum, antichains, chains and density aspects are investigated.
Some algorithms on the star operation applied to finite languages.