Thomas Paranthoën

According to our database, Thomas Paranthoën authored at least 7 papers between 2002 and 2005.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2005

Random generation of DFAs.

Jean-Marc Champarnaud, Thomas Paranthoën

Theor. Comput. Sci., 2005

Brute force determinization of nfas by means of state covers.

Jean-Marc Champarnaud, Fabien Coulon, Thomas Paranthoën

Int. J. Found. Comput. Sci., 2005

2004

Random Generation Models for NFAs.

Jean-Marc Champarnaud, Georges Hansel, Thomas Paranthoën, Djelloul Ziadi

J. Autom. Lang. Comb., 2004

Compact and fast algorithms for safe regular expression search.

Jean-Marc Champarnaud, Fabien Coulon, Thomas Paranthoën

Int. J. Comput. Math., 2004

2003

Random DFAs over a Non-Unary Alphabet.

Jean-Marc Champarnaud, Thomas Paranthoën

Proceedings of the 5th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2003, Budapest, Hungary, July 12, 2003

2002

Split and join for minimizing: Brzozowski's algorithm.

Jean-Marc Champarnaud, Ahmed Khorsi, Thomas Paranthoën

Proceedings of the Prague Stringology Conference 2002, Prague, Czech Republic, 2002

NFAs bitstream-based random generation.

Jean-Marc Champarnaud, Georges Hansel, Thomas Paranthoën, Djelloul Ziadi

Proceedings of the Fourth International Workshop on Descriptional Complexity of Formal Systems - DCFS 2002, London, Canada, August 21, 2002