O. Carton and M. Michel, Unambiguous B??chi automata, Theoretical Computer Science, vol.297, issue.1-3, pp.37-81, 2003.
DOI : 10.1016/S0304-3975(02)00618-7
URL : http://dx.doi.org/10.1016/s0304-3975(02)00618-7

J. H. Conway, Regular algebra and finite machines Mathematics series, 1971.

S. Lombardy, On the Construction of Reversible Automata for Reversible Languages, Lect. Notes Comp. Sci, vol.2380, pp.170-182, 2002.
DOI : 10.1007/3-540-45465-9_16
URL : https://hal.archives-ouvertes.fr/hal-00620037

S. Lombardy and J. Sakarovitch, Star Height of Reversible Languages and Universal Automata, Lect. Notes Comp. Sci, vol.2286, pp.76-90, 2002.
DOI : 10.1007/3-540-45995-2_12
URL : https://hal.archives-ouvertes.fr/hal-00017159

S. Lombardy and J. Sakarovitch, The universal automaton of Texts in Logic and Games, Logic and Automata, pp.457-504, 2008.

D. Perrin and J. And-pin, Semigroups and Automata on Infinite Words, Semigroups, Formal Languages and Groups Kluwer academic publishers, pp.49-72, 1995.
DOI : 10.1007/978-94-011-0149-3_3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.160.5612

L. Polák, MINIMALIZATIONS OF NFA USING THE UNIVERSAL AUTOMATON, International Journal of Foundations of Computer Science, vol.16, issue.05, pp.999-1010, 2005.
DOI : 10.1142/S0129054105003431

J. Sakarovitch, Elements of Automata Theory, 2009.
DOI : 10.1017/CBO9781139195218