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, REGAL: A Library to Randomly and Exhaustively Generate Automata, CIAA'07, pp.303-305, 2007.
DOI : 10.1007/978-3-540-76336-9_28
URL : https://hal.archives-ouvertes.fr/hal-00459643

F. Bassino, J. David, and C. Nicaud, Enumeration and random generation of possibly incomplete deterministic automata, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00452748

F. Bassino, J. David, and C. Nicaud, On the average complexity of Moore's state minimization algorithm, STACS'09 of Leibniz International Proceedings in Informatics Schloss Dagstuhl -LCI. urn:nbn:de, pp.123-1340030, 2009.

M. Boja´nczykboja´nczyk 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

J. M. 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

Y. F. Chen, A. Farzan, E. M. Clarke, Y. K. Tsay, W. et al., Learning Minimal Separating DFA???s for Compositional Verification, TACAS'09, pp.31-45, 2009.
DOI : 10.1007/978-3-540-73368-3_8

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

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

F. Neven, Automata theory for XML researchers, ACM SIGMOD Record, vol.31, issue.3, pp.39-46, 2002.
DOI : 10.1145/601858.601869

S. Schewe, Büchi complementation made tight, STACS'09 of Leibniz International Proceedings in Informatics Schloss Dagstuhl -LCI. urn:nbn:de, pp.661-6720030, 2009.

D. Tabakov and M. Y. Vardi, Experimental Evaluation of Classical Automata Constructions, LPAR'05, pp.396-41110, 2005.
DOI : 10.1007/11591191_28

B. Cate and L. Segoufin, Transitive closure logic, and nested tree walking automata, and Xpath, PODS'08, pp.251-260, 2008.
DOI : 10.1145/1706591.1706598

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

M. D. Wulf, L. Doyen, T. A. Henzinger, and J. F. And-raskin, Antichains: A New Algorithm for Checking Universality of Finite Automata, Lecture Notes in Computer Science, vol.4144, issue.06, pp.17-30, 2006.
DOI : 10.1007/11817963_5