NFAs bitstream-based random generation. - Jean-Marc Champarnaud; Georges Hansel; Thomas Paranthoën; Djelloul Ziadi (DCFS, 2002)

Split and join for minimizing: Brzozowski's algorithm. - Jean-Marc Champarnaud; Ahmed Khorsi; Thomas Paranthoën (Stringology, 2002)

Random DFAs over a Non-Unary Alphabet. - Jean-Marc Champarnaud; Thomas Paranthoën (DCFS, 2003)

Compact and fast algorithms for safe regular expression search. - Jean-Marc Champarnaud; Fabien Coulon; Thomas Paranthoën (Int. J. Comput. Math., 2004)

Random Generation Models for NFAs. - Jean-Marc Champarnaud; Georges Hansel; Thomas Paranthoën; Djelloul Ziadi (J. Autom. Lang. Comb., 2004)

Brute force determinization of nfas by means of state covers. - Jean-Marc Champarnaud; Fabien Coulon; Thomas Paranthoën (Int. J. Found. Comput. Sci., 2005)

Random generation of DFAs. - Jean-Marc Champarnaud; Thomas Paranthoën (Theor. Comput. Sci., 2005)