Straubing's wreath product principle provides a description of the languages recognized by the wreath product of two monoids. A similar principle for ordered semigroups is given in this paper. Applications to language theory extend standard results of the theory of varieties to positive varieties. They include a characterization of positive locally testable languages and syntactic descriptions of the operations L ! La and L ! LaA . Next we turn to concatenation hierarchies. It was shown by Straubing that the n-th level Bn of the dot-depth hierarchy is the variety V n LI, where LI is the variety of locally trivial semigroups and V n is the n-th level of the Straubing-Therien hierarchy. We prove that a similar result holds for the ha...
AbstractA logical characterization of natural subhierarchies of the dot-depth hierarchy refining a t...
We use ordered categories to study semidirect decompositions of finite ordered semigroups. We obtain...
Finite automata and rational languages are fundamental concepts in theoretical computer science and ...
Straubing's wreath product principle provides a description of the languages recognized by the wreat...
International audienceIs it well-known that there exists a one-to-one correspondence between varieti...
New connections are discovered between formal language theory and model theory. We give logical char...
special issue dedicated to the second edition of the conference AutoMathA: from Mathematics to Appli...
This paper studies the fine structure of the Straubing hierarchy of star-free languages. Sequences o...
AbstractThis paper is a contribution to the problem of effectively determining the dot-depth of a st...
In a previous paper, the authors studied the polynomial closure of a variety of languages and gave a...
Abstract. In the seventies, several classification schemes for the rational languages were proposed,...
International audienceIf we consider words over the alphabet which is the set of all elements of a s...
AbstractThis paper is a contribution to the problem of effectively determining the dot-depth of a st...
AbstractWe use the recently developed theory of finite categories and the two-sided kernel to study ...
Finite automata and rational languages are fundamental concepts in theoretical computer science and ...
AbstractA logical characterization of natural subhierarchies of the dot-depth hierarchy refining a t...
We use ordered categories to study semidirect decompositions of finite ordered semigroups. We obtain...
Finite automata and rational languages are fundamental concepts in theoretical computer science and ...
Straubing's wreath product principle provides a description of the languages recognized by the wreat...
International audienceIs it well-known that there exists a one-to-one correspondence between varieti...
New connections are discovered between formal language theory and model theory. We give logical char...
special issue dedicated to the second edition of the conference AutoMathA: from Mathematics to Appli...
This paper studies the fine structure of the Straubing hierarchy of star-free languages. Sequences o...
AbstractThis paper is a contribution to the problem of effectively determining the dot-depth of a st...
In a previous paper, the authors studied the polynomial closure of a variety of languages and gave a...
Abstract. In the seventies, several classification schemes for the rational languages were proposed,...
International audienceIf we consider words over the alphabet which is the set of all elements of a s...
AbstractThis paper is a contribution to the problem of effectively determining the dot-depth of a st...
AbstractWe use the recently developed theory of finite categories and the two-sided kernel to study ...
Finite automata and rational languages are fundamental concepts in theoretical computer science and ...
AbstractA logical characterization of natural subhierarchies of the dot-depth hierarchy refining a t...
We use ordered categories to study semidirect decompositions of finite ordered semigroups. We obtain...
Finite automata and rational languages are fundamental concepts in theoretical computer science and ...