A classification of rational languages by semilattice-ordered monoids

Warning

This publication doesn't include Institute of Computer Science. It includes Faculty of Science. Official publication website can be found on muni.cz.

Authors	POLÁK Libor
Year of publication	2004
Type	Article in Periodical
Magazine / Source	Archivum Mathematicum
MU Faculty or unit	Faculty of Science
Citation
Field	General mathematics
Keywords	syntactic semilattice-ordered monoid; conjunctive variety of languages
Description	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.
Related projects:	Mathematical structures of algebra and geometry