The Eilenberg correspondence relates varieties of regular languages with pseudovarieties of finite monoids. Various modifications of this correspondence have been found with more general classes of regular languages on one hand and classes of more complex algebraic structures on the other hand. It is also possible to consider classes of automata instead of algebraic structures as a natural counterpart of classes of languages. Here we deal with the correspondence relating positive varieties of languages to positive-varieties of ordered automata and we demonstrate various specific instances of this correspondence. These bring certain well-known results from a new perspective and also some new observations. Moreover, complexity aspects of the membership problem are discussed both in the particular examples and in a general setting.
CITATION STYLE
Klíma, O., & Polák, L. (2019). On Varieties of Ordered Automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11417 LNCS, pp. 108–120). Springer Verlag. https://doi.org/10.1007/978-3-030-13435-8_8
Mendeley helps you to discover research relevant for your work.