Add to ORKGsummary:We prove here an Eilenberg type theorem: the so-called conjunctive varieties of rational languages correspond to the pseudovarieties of finite semilattice-ordered monoids. Taking complements of members of a conjunctive variety of languages we get a so-called disjunctive variety. We present here a non-trivial example of such a variety together with an equational characterization of the corresponding pseudovariety
The main goal in this paper is to use a dual equivalence in automata theory started in [25] and deve...
In this paper, a characterization of the language varieties and congruence varieties corresponding t...
This chapter gives an overview on what is often called the algebraic theory of finite automata. It d...
summary:We prove here an Eilenberg type theorem: the so-called conjunctive varieties of rational lan...
AbstractIt is well known that varieties of rational languages are in one-to-one correspondence with ...
AbstractThe notion of the syntactic monoid is well known to be very important for formal languages, ...
AbstractA classification scheme for regular languages or finite semigroups was proposed by Pin throu...
We present an extension of Eilenberg's variety theorem, a well-known result connecting algebra to fo...
This article is a continuation of the work of the second author on the connections between the theor...
AbstractThe notion of the syntactic monoid is well known to be very important for formal languages, ...
International audienceWe present an extension of Eilenberg's variety theorem, a well-known result co...
We present an extension of Eilenberg's variety theorem, a well-known result connecting algebra to fo...
The main goal in this paper is to use a dual equivalence in automata theory started in [25] and deve...
AbstractEilenberg’s variety theorem gives a bijective correspondence between varieties of languages ...
The main goal in this paper is to use a dual equivalence in automata theory started in [25] and deve...
The main goal in this paper is to use a dual equivalence in automata theory started in [25] and deve...
In this paper, a characterization of the language varieties and congruence varieties corresponding t...
This chapter gives an overview on what is often called the algebraic theory of finite automata. It d...
summary:We prove here an Eilenberg type theorem: the so-called conjunctive varieties of rational lan...
AbstractIt is well known that varieties of rational languages are in one-to-one correspondence with ...
AbstractThe notion of the syntactic monoid is well known to be very important for formal languages, ...
AbstractA classification scheme for regular languages or finite semigroups was proposed by Pin throu...
We present an extension of Eilenberg's variety theorem, a well-known result connecting algebra to fo...
This article is a continuation of the work of the second author on the connections between the theor...
AbstractThe notion of the syntactic monoid is well known to be very important for formal languages, ...
International audienceWe present an extension of Eilenberg's variety theorem, a well-known result co...
We present an extension of Eilenberg's variety theorem, a well-known result connecting algebra to fo...
The main goal in this paper is to use a dual equivalence in automata theory started in [25] and deve...
AbstractEilenberg’s variety theorem gives a bijective correspondence between varieties of languages ...
The main goal in this paper is to use a dual equivalence in automata theory started in [25] and deve...
The main goal in this paper is to use a dual equivalence in automata theory started in [25] and deve...
In this paper, a characterization of the language varieties and congruence varieties corresponding t...
This chapter gives an overview on what is often called the algebraic theory of finite automata. It d...