J. Adámek, F. Bonchi, M. Hülsbusch, B. König, S. Milius et al., A Coalgebraic Perspective on Minimization and Determinization, FoSSaCS. pp, pp.58-73, 2012.
DOI : 10.1007/978-3-642-28729-9_4

J. Adámek, S. Milius, L. S. Moss, and L. Sousa, Well-Pointed Coalgebras (Extended Abstract), pp.89-103, 2012.
DOI : 10.1007/978-3-642-28729-9_6

M. Barr, Terminal coalgebras in well-founded set theory, Theoretical Computer Science, vol.114, issue.2, pp.299-315, 1993.
DOI : 10.1016/0304-3975(93)90076-6

N. Bezhanishvili, C. Kupke, and P. Panangaden, Minimization via Duality, pp.191-205, 2012.
DOI : 10.1007/978-3-642-32621-9_14

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

F. Bonchi, M. M. Bonsangue, M. Boreale, J. J. Rutten, and A. 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

F. Bonchi, M. M. Bonsangue, J. J. Rutten, and A. Silva, Brzozowski???s Algorithm (Co)Algebraically, Logic and Program Semantics, pp.12-23, 2012.
DOI : 10.1007/978-3-642-29485-3_2

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, p.7, 2013.
DOI : 10.1145/2422085.2422092

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

J. Brzozowski and H. Tamm, Theory of ??tomata, Proc. 15th International Conference on Developments in Language Theory (DLT'11, pp.105-116, 2011.
DOI : 10.1007/978-3-642-22321-1_10

J. A. Brzozowski, Canonical regular expressions and minimal state graphs for definite events, N.Y, vol.12, pp.529-561, 1962.

F. Denis, A. Lemay, and A. Terlutte, Residual Finite State Automata, Fund. Inform. XX, pp.1-30, 2002.
DOI : 10.1007/3-540-44693-1_13

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

I. Hasuo, B. Jacobs, and A. Sokolova, Generic Trace Semantics via Coinduction, Logical Methods in Computer Science, vol.3, issue.4, p.11, 2007.
DOI : 10.2168/LMCS-3(4:11)2007

B. Jacobs, A. Silva, and A. Sokolova, Trace Semantics via Determinization, Proc. CMCS 2012, pp.109-129, 2012.
DOI : 10.1007/978-3-642-32784-1_7

P. Jipsen, Categories of Algebraic Contexts Equivalent to Idempotent Semirings and Domain Semirings, RAMICS. Lecture Notes in Computer Science, vol.74, issue.2, pp.195-206, 2012.
DOI : 10.1007/BF01190610

S. Lombardy and J. Sakarovitch, The universal automaton, Logic and Automata. Texts in Logic and Games, pp.457-504, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00620807

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

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

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

J. Vuillemin and N. Gama, Efficient Equivalence and Minimization for Non Deterministic Xor Automata, Research report LIENS, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00487031