Calcul de la distance par les sous-mots
Characterizations of right dense languages.
Closure operators on languages and binary relations.
Codes avec des mots infinis
Codes limites et factorisations finies du monoïde libre
Commutative images of rational languages and the abelian kernel of a monoid
Natural algorithms to compute rational expressions for recognizable languages, even those which work well in practice, may produce very long expressions. So, aiming towards the computation of the commutative image of a recognizable language, one should avoid passing through an expression produced this way. We modify here one of those algorithms in order to compute directly a semilinear expression for the commutative image of a recognizable language. We also give a second modification of the algorithm...
Commutative images of rational languages and the Abelian kernel of a monoid
Natural algorithms to compute rational expressions for recognizable languages, even those which work well in practice, may produce very long expressions. So, aiming towards the computation of the commutative image of a recognizable language, one should avoid passing through an expression produced this way. We modify here one of those algorithms in order to compute directly a semilinear expression for the commutative image of a recognizable language. We also give a second modification of the algorithm...
Complément à l'étude des suites de Thue-Morse généralisées
Conjugacy in monoids.
Constructing finitely presented monoids which have no finite complete presentation.
Construction de codes indécomposables
Continuous monoids and yields of infinite trees
Crossability of cancellative Kleene semigroups