More on graphic toposes
Mots infinis de Fibonacci et morphismes itérés
Mots sans répétitions et langages rationnels bornés
Note on compatible well orders on a free monoid.
Notes on finite asynchronous automata
On a subclass of context-free groups
On autogenerating systems
On certain codes admitting inverse semigroups as syntactic monoids.
On closure operators on monoids
On commutative Kleene monoids.
On free inverse monoid languages
On graph products of automatic monoids
The graph product is an operator mixing direct and free products. It is already known that free products and direct products of automatic monoids are automatic. The main aim of this paper is to prove that graph products of automatic monoids of finite geometric type are still automatic. A similar result for prefix-automatic monoids is established.
On graph products of automatic monoids
The graph product is an operator mixing direct and free products. It is already known that free products and direct products of automatic monoids are automatic. The main aim of this paper is to prove that graph products of automatic monoids of finite geometric type are still automatic. A similar result for prefix-automatic monoids is established.
On ideal extensions of completely simple semigroups.
On infinitary finite length codes
On one definition of grammatical categories
On optimal factorization of free semigroups into free subsemigroups.
On recognition and compactification.
On right congruences associated with the input semigroup S of automata.
On semisimple bands.