J. Adámek, S. Milius, and J. Velebil, Iterative algebras at work, Mathematical Structures in Computer Science, vol.16, issue.06, pp.1085-1131, 2006.
DOI : 10.1017/S0960129506005706

M. M. Bonsangue, S. Milius, and A. Silva, Sound and Complete Axiomatizations of Coalgebraic Language Equivalence, ACM Transactions on Computational Logic, vol.14, issue.1, pp.1-752, 2013.
DOI : 10.1145/2422085.2422092

R. V. Book and S. A. Greibach, Quasi-realtime languages, Mathematical Systems Theory, vol.14, issue.1, pp.97-111, 1970.
DOI : 10.1007/BF01705890

J. A. Brzozowski, Derivatives of Regular Expressions, Journal of the ACM, vol.11, issue.4, pp.481-494, 1964.
DOI : 10.1145/321239.321249

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

D. Coumans and B. Jacobs, Scalars, monads, and categories Quantum physics and linguistics. A compositional, diagrammatic discourse, pp.184-216, 2013.
DOI : 10.1093/acprof:oso/9780199646296.003.0007

URL : http://arxiv.org/abs/1003.0585

B. Courcelle, Fundamental properties of infinite trees, Theoretical Computer Science, vol.25, issue.2, pp.95-169, 1983.
DOI : 10.1016/0304-3975(83)90059-2

URL : http://doi.org/10.1016/0304-3975(83)90059-2

M. Droste, W. Kuich, and H. Vogler, Handbook of Weighted Automata, 2009.
DOI : 10.1007/978-3-642-01492-5

M. P. Fiore, E. Moggi, and D. Sangiorgi, A Fully Abstract Model for the ??-calculus, Information and Computation, vol.179, issue.1, pp.76-117, 2002.
DOI : 10.1006/inco.2002.2968

P. Freyd, Algebra valued functors in general and tensor products in particular, Colloq. Math, vol.14, pp.89-106, 1966.

J. A. Goguen, J. W. Thatcher, E. G. Wagner, and J. B. Wright, Initial Algebra Semantics and Continuous Algebras, Journal of the ACM, vol.24, issue.1, pp.68-95, 1977.
DOI : 10.1145/321992.321997

S. Goncharov, Trace Semantics via Generic Observations, CALCO 2013, 2013.
DOI : 10.1007/978-3-642-40206-7_13

M. Hyland, P. B. Levy, G. D. Plotkin, and J. Power, Combining algebraic effects with continuations, Theoretical Computer Science, vol.375, issue.1-3, pp.1-3, 2007.
DOI : 10.1016/j.tcs.2006.12.026

URL : http://doi.org/10.1016/j.tcs.2006.12.026

B. Jacobs, K. Futatsugi, J. P. Jouannaud, and J. Meseguer, A Bialgebraic Review of Deterministic Automata, Regular Expressions and Languages, Algebra, Meaning, and Computation , Essays Dedicated to Joseph A. Goguen on the Occasion of His 65th Birthday, pp.375-404, 2006.
DOI : 10.1007/11780274_20

B. Jacobs, Coalgebraic Trace Semantics for Combined Possibilitistic and Probabilistic Systems, Electronic Notes in Theoretical Computer Science, vol.203, issue.5, pp.131-152, 2008.
DOI : 10.1016/j.entcs.2008.05.023

URL : http://doi.org/10.1016/j.entcs.2008.05.023

B. Jacobs, A. Silva, and A. Sokolova, Trace semantics via determinization, CMCS'12, pp.109-129, 2012.
DOI : 10.1007/978-3-642-32784-1_7

URL : http://repository.ubn.ru.nl/bitstream/2066/103855/1/103855.pdf

A. Kock, On Double Dualization Monads., MATHEMATICA SCANDINAVICA, vol.27, pp.151-165, 1970.
DOI : 10.7146/math.scand.a-10995

URL : http://www.digizeitschriften.de/download/PPN35397434X_0027/PPN35397434X_0027___log16.pdf

M. Lane and S. , Categories for the Working Mathematician, 1971.
DOI : 10.1007/978-1-4612-9839-7

S. Milius, A Sound and Complete Calculus for Finite Stream Circuits, 2010 25th Annual IEEE Symposium on Logic in Computer Science, pp.449-458, 2010.
DOI : 10.1109/LICS.2010.11

E. Moggi, Notions of computation and monads, Information and Computation, vol.93, issue.1, pp.55-92, 1991.
DOI : 10.1016/0890-5401(91)90052-4

R. Myers, Rational Coalgebraic Machines in Varieties: Languages, Completeness and Automatic Proofs, 2013.

G. Plotkin and J. Power, Notions of Computation Determine Monads, FoSSaCS'02, pp.342-356, 2002.
DOI : 10.1007/3-540-45931-6_24

J. Power and O. Shkaravska, From Comodels to Coalgebras: State and Arrays, Electronic Notes in Theoretical Computer Science, vol.106, pp.297-314, 2004.
DOI : 10.1016/j.entcs.2004.02.041

URL : http://doi.org/10.1016/j.entcs.2004.02.041

M. O. Rabin and D. Scott, Finite Automata and Their Decision Problems, IBM Journal of Research and Development, vol.3, issue.2, pp.114-125, 1959.
DOI : 10.1147/rd.32.0114

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

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

R. Segala, Modelling and Verification of Randomized Distributed Real-Time Systems, 1995.

R. Segala and N. A. Lynch, Probabilistic simulations for probabilistic processes, Nordic Journal of Computing, vol.2, issue.2, pp.250-273, 1995.
DOI : 10.1007/bfb0015027

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

A. Silva, Kleene coalgebra, 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, 2013.
DOI : 10.2168/LMCS-9(1:9)2013

URL : https://hal.archives-ouvertes.fr/hal-00909339

D. Varacca and G. Winskel, Distributing probability over non-determinism, Mathematical Structures in Computer Science, vol.16, issue.01, pp.87-113, 2006.
DOI : 10.1017/S0960129505005074

J. Winter, M. M. Bonsangue, and J. J. Rutten, Coalgebraic characterizations of contextfree languages, LMCS, vol.9, issue.3, 2013.