Regular Varieties of Automata and Coequations
Presented at the International Conference on Mathematics of Program Construction
In this paper we use a duality result between equations and coequations for automata, proved by Ballester-Bolinches, Cosme-Ll´opez, 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.
|Software (theme 1)|
|Lecture Notes in Computer Science|
|International Conference on Mathematics of Program Construction|
|Published paper: DOI: 10.1007/978-3-319-19797-5_11|
|This work was funded by the The Netherlands Organisation for Scientific Research (NWO); grant id nwo/612.001.210 - Enhancing efficiency and expressiveness of the coinduction proof method|
Salamanca Tellez, J.R, Ballester-Bolinches, A, Bonsangue, M.M, Cosme-Llopez, E, & Rutten, J.J.M.M. (2015). Regular Varieties of Automata and Coequations. In Proceedings of International Conference on Mathematics of Program Construction 2015 (MPC 0). Springer.