According to our database1, Thomas Paranthoën authored at least 8 papers between 2002 and 2005.
Legend:Book In proceedings Article PhD thesis Other
Random generation of DFAs.
Theor. Comput. Sci., 2005
Brute force determinization of nfas by means of state covers.
Int. J. Found. Comput. Sci., 2005
Random Generation Models for NFAs.
Journal of Automata, Languages and Combinatorics, 2004
Compact and fast algorithms for safe regular expression search.
Int. J. Comput. Math., 2004
Brute Force Determinization of NFAs by Means of State Covers.
Proceedings of the Implementation and Application of Automata, 2004
Random DFAs over a Non-Unary Alphabet.
Proceedings of the 5th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2003, Budapest, Hungary, July 12, 2003
Split and join for minimizing: Brzozowski's algorithm.
Proceedings of the Prague Stringology Conference 2002, Prague, Czech Republic, 2002
NFAs bitstream-based random generation.
Proceedings of the Fourth International Workshop on Descriptional Complexity of Formal Systems - DCFS 2002, London, Canada, August 21, 2002