Abstract
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.
Cite
CITATION STYLE
Salamanca, J., Ballester-Bolinches, A., Bonsangue, M. M., Cosme-Llòpez, E., & Rutten, J. (2015). Regular varieties of automata and coequations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9129, pp. 224–237). Springer Verlag. https://doi.org/10.1007/978-3-319-19797-5_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
