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 ...

Proper extensions that are “injective on L-related idempotents” of R-unipotent semigroups, and much more generally of the class of generalised left restriction semigroups possessing the ample and congruence conditions, referred to here as glrac semigroups, are described as certain subalgebras of a λ-semidirect product of a left regular band by an R-unipotent or by a glrac semigroup, respectivel...

In this paper $S$ is a monoid with a left zero and $A_S$ (or $A$) is a unitary right $S$-act. It is shown that a monoid $S$ is right perfect (semiperfect) if and only if every (finitely generated) strongly flat right $S$-act is quasi-projective. Also it is shown that if every right $S$-act has a unique zero element, then the existence of a quasi-projective cover for each right act implies that ...

A nitely presented monoid has a decidable word problem if and only if it can be presented by some left-recursive convergent string-rewriting system if and only if it has a recursive cross-section. However, context-free cross-sections or even regular cross-sections do not suuce. This is shown by presenting examples of nitely presented monoids with decidable word problems that do not admit regula...

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.