In this article, we present $GPW$-flatness property of acts over monoids, which is a generalization of principal weak flatness. We say that a right $S$-act $A_{S}$ is $GPW$-flat if for every $s in S$, there exists a natural number $n = n_ {(s, A_{S})} in mathbb{N}$ such that the functor $A_{S} otimes {}_{S}- $ preserves the embedding of the principal left ideal ${}_{S}(Ss^n)$ into ${}_{S}S$. We...

We say that a rational (resp. a subsequential) function tl from a free monoid into another one is in the variety of monoids V if it may realized by some unambiguous (resp. subsequential) transducer whose monoid of transitions is in V. We characterize these functions when V is the variety of aperiodic monoids, and the variety of groups. In the first case, the period of am ’ (15) divides that of ...

The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular languages is the maximal syntactic complexity of languages in that class, taken as a function of the state complexity n of these languages. We study the syntactic complexity of prefix-, suffix-, and bifix-free regular languages. We prove th...

We study the commutative positive varieties of languages closed under various operations: shuffle, renaming and product over one-letter alphabets. Most monoids considered in this paper are finite. In particular, we use the term variety of monoids for variety of finite monoids. Similarly, all languages considered in this paper are regular languages and hence their syntactic monoid is finite.

If we consider words over the alphabet which is the set of all elements of a semigroup S, then such a word determines an element of S: the product of the letters of the word. S is strongly locally testable if whenever two words over the alphabet S have the same factors of a fixed length k, then the products of the letters of these words are equal. We had previously proved [19] that the syntacti...