Publications
Journals
Julien David
Average Complexity of Moore's and Hopcroft's Algorithms.
October 2010. 25 pages. submitted
Frederique Bassino, Julien David, and Cyril Nicaud.
Average Case Analysis of Moore's State Minimization Algorithm.
July 2009. 21 pages. submitted
Frederique Bassino, Julien David, and Cyril Nicaud.
Enumeration and random generation of possibly incomplete
deterministic automata.
Pure Mathematics and Applications. vol. 19(2-3). 2008. pp. 1-16.
In proceedings
Julien David.
The Average Complexity of Moore's State Minimization Algorithm is O(n log log n).
35th International Symposium on Mathematical Foundations of Computer Science (MFCS'10). April 2010. 12 pages. accepted.
Frederique Bassino, Julien David, and Cyril Nicaud.
On the average complexity
of Moore's state minimization algorithm.
In Susanne Albers and
Jean-Yves Marion, editors, 26th International Symposium on Theoretical
Aspects of Computer Science (STACS 2009),
Freiburg, Germany., volume 3
of LIPIcs, pp 123-124. Schloss Dagstuhl - Leibniz-Zentrum fuer Infor-
matik, Germany, 2009.
Frederique Bassino, Julien David, and Cyril Nicaud.
Random generation of possibly
incomplete deterministic automata.
GASCom : Generation
Aleatoire de Structure Combinatoire. June 2008. pp. 31-40.
Julien David.
REGAL: une bibliotheque pour la
generation des automates deterministes.
MAnifestation
des JEunes Chercheurs en Sciences et Technologies
de l'Information et de la
Communication(MAJECSTIC'07). 2007. pp 161-170
Note: in French
Frederique Bassino, Julien David, and Cyril Nicaud.
REGAL: a library to randomly and
exhaustively generate automata.
In, Jan Holub, Jan
Zdarek, editors, 12th International Conference on
Implementation and Application of Automata (CIAA'07). vol. 4783. LNCS. Prague, Czech Republic. July 2007. pp. 303-305.Springer-Verlag.
Posters
Frederique Bassino, Julien David, and Cyril Nicaud.
REGAL: a library to randomly and
exhaustively generate automata.
Presented at CIAA'07. Prague, Czech Republic. July 2007.
PhD Thesis
Generation aleatoire d'automates et analyse d'algorithmes de minimisation.