Regular varieties of automata and coequations
NAGIOS: RODERIC FUNCIONANDO

Regular varieties of automata and coequations

DSpace Repository

Regular varieties of automata and coequations

Show full item record

View       (296.7Kb)

    
Salamanca, J.; Ballester-Bolinches, Adolfo Perfil; Bonsangue, M.M.; Cosme i Llópez, Enric; Rutten, J.J.M.M.
This document is a artículoDate2015

Este documento está disponible también en : http://hdl.handle.net/10550/49060
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

This item appears in the following Collection(s)

Show full item record

Search DSpace

Advanced Search

Browse

Statistics