On Varieties of Ordered Automata
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 \(\mathcal C\)-varieties of languages to positive \(\mathcal C\)-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.
KeywordsAlgebraic language theory Ordered automata
- 1.Brzozowski, J.: Canonical regular expressions and minimal state graphs for definite events. In: Mathematical Theory of Automata, vol. 12, pp. 529–561. Research institute, Brooklyn (1962)Google Scholar
- 8.Klíma, O., Polák, L.: On varieties of ordered automata. CoRR (2017(v1), 2019(v2)). http://arxiv.org/abs/1712.08455
- 12.Pin, J.É.: A variety theorem without complementation. Russ. Math. 39, 80–90 (1995)Google Scholar
- 20.Straubing, H., Weil, P.: Varieties. CoRR (2015). http://arxiv.org/abs/1502.03951