This website is outdated. I keep it there for references pointing documents in it.

Ce site est périmé. Je le garde ici pour les sites incluant des références de documents s'y trouvant.

[0] F. Coulon. Minimisation d'automates non-déterministes, recherche d'expressions dans un texte et comparaison de génomes. Thèse de doctorat de l'université de Rouen, 2004.
[PS de la thèse] [PS de la présentation]

[1] J.-M. Champarnaud and F. Coulon. Enumerating nondeterministic automata for a given language without constructing the canonical automaton. Int. J. Found. Comput. Sci. 16(6): 1253-1266 (2005)

[2] J.-M. Champarnaud, F. Coulon and T. Paranthoen. Compact and Fast Algorithms for Regular Expression Search. Intern. J. of Computer. Math. vol 81(4), 2004.
[Compressed PS] [Software]

[3] J.-M. Champarnaud and F. Coulon. NFA reduction algorithms by means of regular inequalities. Theoret. Comput. Sci , 327(3): 241--253, 2004.
[Compressed PS]

[4] J.-M. Champarnaud and F. Coulon and T. Paranthoen. Brute force determinization of NFAs by means of state covers. In Proceedings of the 9th International Conference, CIAA 2004, 2004.
[Compressed PS]

[5] J.-M. Champarnaud and F. Coulon. Büchi automata reduction by means of left and right trace inclusion preorders. In Proceedings of the Journées Montoises, 2004.
[Compressed PS]

[6] F. Coulon and M. Raffinot. Identification of Maximal Common Connected Sets of Interval Graphs and Tree Forests. To appear in CompBioNets'2004.
[Compressed PS] [Extended journal version (compressed PS)]

CCBot/2.0 (