M. D. Wulf, L. Doyen, T. A. Henzinger, and J. Raskin, Antichains: A New Algorithm for Checking Universality of Finite Automata, CAV'06, pp.17-30, 2006.
DOI : 10.1007/11817963_5

R. J. Van-glabbeek and B. Ploeger, Five Determinisation Algorithms, CIAA'08, pp.161-170, 2008.
DOI : 10.1007/978-3-540-70844-5_17

S. Schewe, Büchi complementation made tight, STACS'09 Leibniz International Proceedings in Informatics, pp.661-672, 2009.

F. Bassino, J. David, and C. Nicaud, On the average complexity of Moore's state minimization algorithm, STACS'09 Leibniz International Proceedings in Informatics, pp.123-134, 2009.

F. Neven, Automata theory for XML researchers, ACM SIGMOD Record, vol.31, issue.3, pp.39-46, 2002.
DOI : 10.1145/601858.601869
URL : http://www.cs.earlham.edu/~kernco/files/theory/web/papers/sr.pdf

M. Murata, D. Lee, M. Mani, and K. Kawaguchi, Taxonomy of XML schema languages using formal language theory, ACM Transactions on Internet Technology, vol.5, issue.4, pp.660-704, 2005.
DOI : 10.1145/1111627.1111631
URL : http://www.idealliance.org/papers/extreme/proceedings/typeset-pdf/2001/Murata01/EML2001Murata01.pdf

J. Engelfriet and H. J. Hoogeboom, Tree-Walking Pebble Automata, Jewels are Forever, pp.72-83, 1999.
DOI : 10.1007/978-3-642-60207-8_7
URL : http://www.wi.leidenuniv.nl/home/engelfri/pebble.ps.gz

M. Boja?czyk and T. Colcombet, Tree-Walking Automata Do Not Recognize All Regular Languages, SIAM Journal on Computing, vol.38, issue.2, pp.658-701, 2008.
DOI : 10.1137/050645427

B. Ten-cate and L. , Segoufin, XPath, transitive closure logic, and nested tree walking automata, PODS'08, pp.251-260, 2008.

D. Tabakov and M. Y. Vardi, Experimental Evaluation of Classical Automata Constructions, LPAR'05, pp.396-411, 2005.
DOI : 10.1007/11591191_28
URL : http://www.cs.rice.edu/~vardi/papers/lpar051.pdf

A. Bouajjani, P. Habermehl, L. Holík, T. Touili, and T. Vojnar, Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata, CIAA'08, pp.57-67, 2008.
DOI : 10.1007/978-3-540-70844-5_7

R. Alur and P. Madhusudan, Visibly pushdown languages, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing , STOC '04, pp.202-211, 2004.
DOI : 10.1145/1007352.1007390
URL : https://repository.upenn.edu/cgi/viewcontent.cgi?article=1174&context=cis_papers

F. Bassino and C. Nicaud, Enumeration and random generation of accessible automata, Theoretical Computer Science, vol.381, issue.1-3, pp.86-104, 2007.
DOI : 10.1016/j.tcs.2007.04.001
URL : https://hal.archives-ouvertes.fr/hal-00459712

F. Bassino, J. David, and C. Nicaud, Enumeration and random generation of possibly incomplete deterministic automata, Pure Mathematics and Applications, vol.19, pp.1-16, 2008.
DOI : 10.1016/j.tcs.2007.04.001
URL : https://hal.archives-ouvertes.fr/hal-00452748

J. Champarnaud and T. Paranthoën, Random generation of DFAs, Theoretical Computer Science, vol.330, issue.2, pp.221-235, 2005.
DOI : 10.1016/j.tcs.2004.03.072
URL : https://doi.org/10.1016/j.tcs.2004.03.072

F. Bassino, J. David, and C. Nicaud, REGAL: A Library to Randomly and Exhaustively Generate Automata, CIAA'07, pp.303-305
DOI : 10.1007/978-3-540-76336-9_28
URL : https://hal.archives-ouvertes.fr/hal-00459643

Y. Chen, A. Farzan, E. M. Clarke, Y. Tsay, and B. Wang, Learning Minimal Separating DFA???s for Compositional Verification, TACAS'09, pp.31-45, 2009.
DOI : 10.1007/978-3-540-73368-3_8
URL : https://link.springer.com/content/pdf/10.1007%2F978-3-642-00768-2_3.pdf

A. Denise and P. Zimmermann, Uniform random generation of decomposable structures using floating-point arithmetic, Theoretical Computer Science, vol.218, issue.2, pp.233-248, 1999.
DOI : 10.1016/S0304-3975(98)00323-5
URL : https://hal.archives-ouvertes.fr/inria-00073447