Equations and Coequations for Weighted Automata
We study weighted automata from both an algebraic and a coalgebraic perspective. In particular, we consider equations and coequations for weighted automata. We prove a duality result that relates sets of equations (congruences) with (certain) subsets of coequations. As a consequence, we obtain two equivalent but complementary ways to define classes of weighted automata. We show that this duality cannot be generalized to linear congruences in general but we obtain partial results when weights are from a field.
- 3.Ballester-Bolinches, A., Cosme-Llópez, E., Rutten, J.J.M.M:. The dual equivalence of equations and coequations for automata. CWI Technical report FM-1403, pp. 1–41 (2014, To appear inInformation and Computation)Google Scholar
- 10.Hungerford, T.W.: Algebra. Graduate Texts in Mathematics, vol. 73. Springer, New York (1974) Google Scholar
- 12.Petković, T.: Varieties of fuzzy languages. In: Proceedings of International Conference on Algebraic Informatics. Aristotle University of Thessaloniki (2005)Google Scholar