A. J. +-12, F. Adámek, M. Bonchi, B. Hülsbusch, S. König et al., A coalgebraic perspective on minimization and determinization, Proc. of FOSSACS '12, pp.58-73, 2012.

A. S. Almagor, U. Boker, O. Kupferman, and G. E. Strecker, What's decidable about weighted automata? Abstract and Concrete Categories -The Joy of Cats, Proc. of ATVA, pp.482-491, 1990.

A. J. Adámek and V. Koubek, On the greatest fixed point of a set functor, Theoretical Computer Science, vol.150, issue.1, pp.57-75, 1995.
DOI : 10.1016/0304-3975(95)00011-K

J. Adámek and J. Rosick´yrosick´y, Locally Presentable and Accessible Categories, 1994.
DOI : 10.1017/CBO9780511600579

. C. Bai96, B. M. Baier, S. Béal, J. Lombardy, and . Sakarovitch, Polynomial time algorithms for testing probabilistic bisimulation and simulation Conjugacy and equivalence of weighted automata and functional transducers, Proc. of CAV '96 Prof. of CSR '06, pp.50-61, 1996.

M. Bonsangue, S. Milius, and A. Silva, Sound and complete axiomatizations of coalgebraic language equivalence Weighted bisimulation in linear algebraic form, 2013. Bor09. M. Boreale Proc. of CONCUR '09, pp.163-177, 2009.

B. F. Bonchi, D. Petrisan, D. Pous, and J. Rot, Coinduction up to in a fibrational setting CoRR abs/1401, DK13. M. Droste and D. Kuske. Weighted automata, 2013. To appear in Automata: from Mathematics to Applications, 1988.

M. Droste, W. K. , and H. Vogler, Handbook of Weighted Automata, Eis03. J. Eisner. Simpler and more general minimization for weighted finite-state automata, 2009.
DOI : 10.1007/978-3-642-01492-5

´. Z. Em10, A. Esik, . Maletti, U. Ferrari, E. Montanari et al., Simulation vs. equivalence Coalgebraic minimization of hd-automata for the ?-calculus using polymorphic types Generic trace semantics via coinduction, Proc. of FCS '10 HJS07. I. Hasuo, B. Jacobs, and A. Sokolova, pp.119-124325, 1979.

. S. Kmo-+-11, A. S. Kiefer, J. Murawski, B. Ouaknine, J. Wachter et al., Language equivalence for probabilistic automata, Proc. of CAV '11, pp.526-540, 2011.

K. D. Krob, The equality problem for rational series with multiplicities in the tropical semiring is undecidable Bisimulation through probabilistic testing (preliminary report), Automata, Languages and Programming Proc. of POPL '89, pp.101-112, 1989.

. M. Moh97 and . Mohri, Finite-state transducers in language and speech processing, Computational Linguistics, vol.23, pp.269-311, 1997.

. M. Moh09 and . Mohri, Weighted automata algorithms, Handbook of Weighted Automata, pp.213-254, 2009.

R. J. +-14, F. Rot, M. Bonchi, J. Bonsangue, D. Rutten et al., Enhanced coalgebraic bisimulation Universal coalgebra: a theory of systems, Mathematical Structures in Computer Science Rut00. J.J.M.M. Rutten. Theoretical Computer Science, vol.249, pp.3-80, 2000.

. S. Sta09 and . Staton, Relating coalgebraic notions of bisimulation, Proc. of CALCO '09, pp.191-205, 2009.

N. Urabe and I. Hasuo, Generic Forward and Backward Simulations III: Quantitative Simulations by Matrices, Proc. of CONCUR '14. Springer, 2014. LNCS/ARCoSS
DOI : 10.1007/978-3-662-44584-6_31