Varieties of finite categories
Alex Weiss, Denis Therien (1986)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Equations on the semidirect product of a finite semilattice by a -trivial monoid of height ”
Varieties of finite categories
How much semigroup structure is needed to encode graphs ?
P. Goralčík, A. Goralčíková, V. Koubek (1986)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Some results on -varieties
Jean-Éric Pin, Howard Straubing (2005)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
In an earlier paper, the second author generalized Eilenberg’s variety theory by establishing a basic correspondence between certain classes of monoid morphisms and families of regular languages. We extend this theory in several directions. First, we prove a version of Reiterman’s theorem concerning the definition of varieties by identities, and illustrate this result by describing the identities associated with languages of the form , where are distinct letters. Next, we generalize...
A conjecture on the concatenation product
Jean-Eric Pin, Pascal Weil (2001)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
In a previous paper, the authors studied the polynomial closure of a variety of languages and gave an algebraic counterpart, in terms of Mal’cev products, of this operation. They also formulated a conjecture about the algebraic counterpart of the boolean closure of the polynomial closure – this operation corresponds to passing to the upper level in any concatenation hierarchy. Although this conjecture is probably true in some particular cases, we give a counterexample in the general...
On the semidirect product of the pseudovariety of semilattices by a locally finite pseudovariety of groups
F. Blanchet-Sadri (1997)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Strongly locally testable semigroups with commuting idempotents and related languages
Carla Selmi (1999)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On semidirect and two-sided semidirect products of finite trivial monoids
F. Blanchet-Sadri (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: