On Reversible Automata. On the Varieties of Languages Associated with Some Varieties of Finite Monoids with Commuting Idempotents. On the Language Accepted by Finite Reversible Automata. Finite Group Topology and p-Adic Topology for Free Monoids. Arbres et Hierarchies de Concatenation.
Languages reconnaissables et codage prefixe pur.
Sur un Cas Particulier de la Conjecture de Cerny.