J. Adámek and V. Koubek, Least fixed point of a functor, J. Comput. Syst. Sci, vol.19, issue.2, pp.90026-90032, 1979.

J. Adámek, S. Milius, and L. S. Moss, Fixed points of functors, Journal of Logical and Algebraic Methods in Programming, vol.95, pp.41-81, 2018.

A. Arnold and D. Niwi´nskiniwi´nski, Rudiments of µ-Calculus, Studies in Logic and the Foundations of Mathematics, 2001.

F. Borceux, Handbook of Categorical Algebra, Encyclopedia of Mathematics and its Applications, vol.1, 1994.

V. Ciancia and Y. Venema, Stream automata are coalgebras, Proc. CMCS 2012, vol.7399, pp.90-108, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01539881

R. Cleaveland, M. Klein, and B. Steffen, Faster model checking for the modal mucalculus, Proc. CAV '92, vol.663, pp.410-422, 1992.

B. Courcelle, Fundamental properties of infinite trees, Theor. Comput. Sci, vol.25, issue.83, pp.90059-90061, 1983.

K. Etessami, T. Wilke, and R. A. Schuller, Fair simulation relations, parity games, and state space reduction for Büchi automata, SICOMP, vol.34, issue.5, pp.1159-1175, 2005.

N. Ghani, P. Hancock, and D. Pattinson, Representations of stream processors using nested fixed points, Logical Methods in Computer Science, vol.5, issue.3, 2009.

I. Hasuo and B. Jacobs, Context-free languages via coalgebraic trace semantics, Proc. CALCO 2005, vol.3629, pp.213-231, 2005.

I. Hasuo, B. Jacobs, and A. Sokolova, Generic trace semantics via coinduction, Logical Methods in Computer Science, vol.3, issue.4, 2007.

B. Jacobs, Trace semantics for coalgebras, Electr. Notes Theor. Comput. Sci, vol.106, pp.167-184, 2004.

B. Jacobs, Introduction to Coalgebra: Towards Mathematics of States and Observation. Cambridge Tracts in Theoret. Comp. Sci, 2016.

S. Milius, Completely iterative algebras and completely iterative monads. Information and Computation, vol.196, pp.1-41, 2005.

P. S. Mulry, Lifting theorems for Kleisli categories, Proc. MFPS IX, vol.802, pp.304-319, 1993.

J. Power and D. Turi, A coalgebraic foundation for linear time semantics, Electr. Notes Theor. Comput. Sci, vol.29, pp.259-274, 1999.

W. Thomas, Languages, Automata, and Logic, pp.389-455, 1997.

N. Urabe and I. Hasuo, Coalgebraic infinite traces and Kleisli simulations, 2015.

N. Urabe and I. Hasuo, Fair Simulation for Nondeterministic and Probabilistic Buechi Automata: a Coalgebraic Perspective. LMCS, vol.13, 2017.

N. Urabe and I. Hasuo, Categorical Büchi and parity conditions via alternating fixed points of functors, 2018.

N. Urabe, S. Shimizu, and I. Hasuo, Coalgebraic trace semantics for Büchi and parity automata, :15. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, vol.59, pp.1-24, 2016.