|
Organizers |
A construction of the syntactic semilattice-ordered monoid of a regular language
by
Libor Polák
Masaryk University Brno, Czech Republic
A new author's definition assigns to any language on a (finite) set the monoid from the title. The monoid is finite if and only if the language is regular. Also an Eilenberg type theorem holds here: classes of regular languages containing the empty set, closed with respect to finite meets, quotients and inverse homomorphic images correspond to pseudovarieties of semilattice-ordered monoids. Here we will discuss how to construct such a monoid.
Date received: May 30, 2000
Copyright © 2000 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # caee-83.