S. Awodey, Category Theory, 2010.
DOI : 10.1093/acprof:oso/9780198568612.001.0001

F. Bartels, On Generalized Coinduction and Probabilistic Specification Formats, 2004.

M. M. Bonchi, M. Bonsangue, A. Boreale-rutten, and . Silva, A coalgebraic perspective on linear weighted automata, Information and Computation, vol.211, pp.77-105, 2012.
DOI : 10.1016/j.ic.2011.12.002
URL : https://hal.archives-ouvertes.fr/hal-00576921

J. Beck, Distributive laws, Seminar on triples and categorical homology theory, pp.119-140, 1969.
DOI : 10.1007/BFb0083084

M. M. Bonsangue, H. H. Hansen, A. Kurz, and J. Rot, Presenting Distributive Laws, Lecture Notes in Computer Science, vol.8089, pp.95-109, 2013.
DOI : 10.1007/978-3-642-40206-7_9
URL : http://arxiv.org/abs/1503.02447

F. Bonchi, S. Milius, A. Silva, and F. Zanasi, Killing epsilons with a dagger: A coalgebraic study of systems with algebraic label structure, Theoretical Computer Science, vol.604, pp.102-126, 2015.
DOI : 10.1016/j.tcs.2015.03.024
URL : https://hal.archives-ouvertes.fr/hal-01284933

M. M. Bonsangue, J. Rutten, and J. Winter, Defining contextfree power series coalgebraically, Pattinson and Schröder [PS12], pp.20-39
DOI : 10.1007/978-3-642-32784-1_2

A. Janusz and . Brzozowski, Derivatives of regular expressions, Journal of the ACM, vol.11, pp.481-494, 1964.

M. Barr and C. Wells, Toposes, triples, and theories. Grundlehren der mathematischen Wissenschaften, 1985.

E. Cheng, Iterated distributive laws, Mathematical Proceedings of the Cambridge Philosophical Society, vol.431, issue.03, 2007.
DOI : 10.1017/CBO9780511525896

B. Jacobs, A Bialgebraic Review of Deterministic Automata, Regular Expressions and Languages, Essays Dedicated to Joseph A. Goguen, pp.375-404, 2006.
DOI : 10.1007/11780274_20

B. Jacobs, Distributive laws for the coinductive solution of recursive equations, Information and Computation, vol.204, issue.4, pp.561-587, 2006.
DOI : 10.1016/j.ic.2005.03.006

B. Jacobs, A. Silva, and A. Sokolova, Trace semantics via determinization, Pattinson and Schröder [PS12], pp.109-129
DOI : 10.1007/978-3-642-32784-1_7
URL : http://repository.ubn.ru.nl/bitstream/2066/103855/1/103855.pdf

B. Klin, Bialgebras for structural operational semantics: An introduction, Theoretical Computer Science, vol.412, issue.38, pp.5043-5069, 2011.
DOI : 10.1016/j.tcs.2011.03.023
URL : http://doi.org/10.1016/j.tcs.2011.03.023

M. Lenisa, J. Power, and H. Watanabe, Distributivity for endofunctors, pointed and co-pointed endofunctors, monads and comonads, Electronic Notes in Theoretical Computer Science, vol.33, pp.230-260, 2000.
DOI : 10.1016/S1571-0661(05)80350-0
URL : http://doi.org/10.1016/s1571-0661(05)80350-0

S. Maclane, Categories for the Working Mathematician, 1971.

S. Milius, L. S. Moss, and D. Schwencke, Abstract GSOS Rules and a Modular Treatment of Recursive Definitions, Logical Methods in Computer Science, vol.9, issue.3, p.2013
DOI : 10.2168/LMCS-9(3:28)2013

S. Milius, D. Pattinson, and T. Wißmann, A new foundation for finitary corecursion. CoRR, abs Revised Selected Papers Integro-differential polynomials and operators, Coalgebraic Methods in Computer Science -11th International Workshop Proceedings of the Twenty-first International Symposium on Symbolic and Algebraic Computation, ISSAC '08, pp.261-268, 1532.
DOI : 10.1007/978-3-662-49630-5_7
URL : http://arxiv.org/abs/1601.01532

J. Rutten, Automata and coinduction (an exercise in coalgebra), Lecture Notes in Computer Science, vol.1466, pp.194-218, 1998.
DOI : 10.1007/BFb0055624
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.221.6957

J. Rutten, Universal coalgebra: a theory of systems, Theoretical Computer Science, vol.249, issue.1, pp.3-80, 2000.
DOI : 10.1016/S0304-3975(00)00056-6

J. Rutten, Behavioural differential equations: a coinductive calculus of streams, automata, and power series, Theoretical Computer Science, vol.308, issue.1-3, pp.1-53, 2003.
DOI : 10.1016/S0304-3975(02)00895-2

J. Rutten, A coinductive calculus of streams, Mathematical Structures in Computer Science, vol.15, issue.1, pp.93-147, 2005.
DOI : 10.1017/S0960129504004517

A. Silva, F. Bonchi, M. M. Bonsangue, and J. Rutten, Generalizing the powerset construction, coalgebraically, LIPIcs, vol.8, pp.272-283, 2010.

A. Silva, F. Bonchi, M. Bonsangue, and J. Rutten, Generalizing determinization from automata to coalgebras, Logical Methods in Computer Science, vol.9, issue.1, p.2013
DOI : 10.2168/LMCS-9(1:9)2013
URL : https://hal.archives-ouvertes.fr/hal-00909339

D. Schwencke, Compositional and Effectful Recursive Specification Formats, 2014.

J. Winter, M. M. Bonsangue, and J. Rutten, Context-Free Languages, Coalgebraically, Lecture Notes in Computer Science, vol.6859, pp.359-376, 2011.
DOI : 10.1007/978-3-642-22944-2_25
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.221.6366

J. Winter, M. M. Bonsangue, and J. J. Rutten, Coalgebraic Characterizations of Context-Free Languages, Logical Methods in Computer Science, vol.9, issue.3, pp.14-2013
DOI : 10.2168/LMCS-9(3:14)2013
URL : http://arxiv.org/abs/1308.1228

J. Winter, Coalgebraic Characterizations of Automata-Theoretic Classes, 2014.
DOI : 10.2168/lmcs-9(3:14)2013
URL : http://arxiv.org/abs/1308.1228