Regular varieties of automata and coequations
NAGIOS: RODERIC FUNCIONANDO

Regular varieties of automata and coequations

Repositori DSpace/Manakin

Regular varieties of automata and coequations

Mostra el registre complet de l'element

Visualització       (296.7Kb)

Exportar a Refworks
    
Salamanca, J.; Ballester-Bolinches, Adolfo Perfil; Bonsangue, M.M.; Cosme i Llópez, Enric; Rutten, J.J.M.M.
Aquest document és un/a article, creat/da en: 2015
In this paper we use a duality result between equations and coequations for automata, proved by Ballester-Bolinches, Cosme-Llópez, and Rutten to characterize nonempty classes of deterministic automata that are closed under products, subautomata, homomorphic images, and sums. One characterization is as classes of automata defined by regular equations and the second one is as classes of automata satisfying sets of coequations called varieties of languages. We show how our results are related to Birkhoff's theorem for regular varieties.

    Salamanca, J. Ballester-Bolinches, Adolfo Bonsangue, M.M. Cosme i Llópez, Enric Rutten, J.J.M.M. 2015 Regular varieties of automata and coequations Lecture Notes in Computer Science 9129 224 237
http://dx.doi.org/10.1007/978-3-319-19797-5_11
distribuït sota llicència Creative Commons de Reconeixement-NoComercial 3.0 No adaptada

Aquest element apareix en la col·lecció o col·leccions següent(s)

Mostra el registre complet de l'element

Cerca a RODERIC

Cerca avançada

Visualitza

Estadístiques