On Varieties of Ordered Automata

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14310%2F19%3A00108264" target="_blank" >RIV/00216224:14310/19:00108264 - isvavai.cz</a>
Result on the web
<a href="https://rd.springer.com/chapter/10.1007%2F978-3-030-13435-8_8" target="_blank" >https://rd.springer.com/chapter/10.1007%2F978-3-030-13435-8_8</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-030-13435-8_8" target="_blank" >10.1007/978-3-030-13435-8_8</a>

Result language
angličtina
Original language name
On Varieties of Ordered Automata
Original language description
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 C -varieties of languages to positive 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.
Czech name
—
Czech description
—

Project
<a href="/en/project/GA15-02862S" target="_blank" >GA15-02862S: Applications of Algebra and Combinatorics in Formal Language Theory</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2019
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)