Actions of semilattices.
Addition molle et fonctions p-locales.
Algebraic and graph-theoretic properties of infinite -posets
A -labeled -poset is an (at most) countable set, labeled in the set , equipped with partial orders. The collection of all -labeled -posets is naturally equipped with binary product operations and -ary product operations. Moreover, the -ary product operations give rise to
Algebraic and graph-theoretic properties of infinite n-posets
A Σ-labeled n-poset is an (at most) countable set, labeled in the set Σ, equipped with n partial orders. The collection of all Σ-labeled n-posets is naturally equipped with n binary product operations and nω-ary product operations. Moreover, the ω-ary product operations give rise to nω-power operations. We show that those Σ-labeled n-posets that can be generated from the singletons by the binary and ω-ary product operations form the free algebra on Σ in a variety axiomatizable by an infinite collection...
Algebraic theory of finite semigroups
An addition theorem for finite semigroups.
An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid
We investigate the intersection of two finitely generated submonoids of the free monoid on a finite alphabet. To this purpose, we consider automata that recognize such submonoids and we study the product automata recognizing their intersection. By using automata methods we obtain a new proof of a result of Karhumäki on the characterization of the intersection of two submonoids of rank two, in the case of prefix (or suffix) generators. In a more general setting, for an arbitrary number of generators,...
An order topology for finitely generated free monoids.
Applications biséquentielles d'un monoïde libre dans un autre
Automata accepting primitive words.
Automates et commutations partielles
Autonomous automata and closures with the same endomorphism monoids
Bi-infinitary codes
Bilateral semidirect products of transformation semigroups.
Binary words avoided by the Thue-Morse sequence.
Bisections reconnaissables
Bounds on the index and period of a binary relation on a finite set.
Calcul de la distance par les sous-mots
Characterizations of right dense languages.
Closure operators on languages and binary relations.