Introduction aux langages reconnaissables
Inverse monoids and rational Schreier subsets of the free group.
Inverse monoids and rational subsets of related groups.
Krohn-Rhodes complexity pseudovarieties are not finitely based
We prove that the pseudovariety of monoids of Krohn-Rhodes complexity at most is not finitely based for all . More specifically, for each pair of positive integers , we construct a monoid of complexity , all of whose -generated submonoids have complexity at most .
Krohn-Rhodes complexity pseudovarieties are not finitely based
We prove that the pseudovariety of monoids of Krohn-Rhodes complexity at most n is not finitely based for all n>0. More specifically, for each pair of positive integers n,k, we construct a monoid of complexity n+1, all of whose k-generated submonoids have complexity at most n.
Langages définis par des congruences
Langages formels et monoïdes finis
Languages recognized by programs over the two-element monoid.
Languajes and monoids with disjuntive identity.
Limited semaphore codes.
Locally testable semigroups.
Maximal prefix products.
Maximality of codes in free monoids
Monoïde libre et musique : deuxième partie
Monoïde libre et musique, première partie : les musiciens ont-ils besoin des mathématiques ?
Monoides de comptage et langages rationnels.
Monoides parcialmente aditivos en la teoría de la información.
Partially-additive monoids (pams) were introduced by Arbib and Manes ([1]) in order to provide an algebraic approach to the semantic of recursion in theoretical computer science. Here we extend the range of application of pams for capturing information theory concepts as componibility and sequential continuity, which arise naturally in this framework.
Monoides pointes.
Monoïdes syntactiques et familles de langages rationnels
Monoids of languages admitting ring structures.