| 2006 |
|---|
| 9 | EE | Fabien Coulon,
Mathieu Raffinot:
Fast algorithms for identifying maximal common connected sets of interval graphs.
Discrete Applied Mathematics 154(12): 1709-1721 (2006) |
| 2005 |
|---|
| 8 | EE | Jean-Marc Champarnaud,
Fabien Coulon,
Thomas Paranthoën:
Brute force determinization of nfas by means of state covers.
Int. J. Found. Comput. Sci. 16(3): 441-451 (2005) |
| 7 | EE | Jean-Marc Champarnaud,
Fabien Coulon:
Enumerating nondeterministic automata for a given language without constructing the canonical automaton.
Int. J. Found. Comput. Sci. 16(6): 1253-1266 (2005) |
| 6 | EE | Jean-Marc Champarnaud,
Fabien Coulon:
Erratum to "NFA reduction algorithms by means of regular inequalities" [TCS 327 (2004) 241-253].
Theor. Comput. Sci. 347(1-2): 437-440 (2005) |
| 2004 |
|---|
| 5 | EE | Jean-Marc Champarnaud,
Fabien Coulon,
Thomas Paranthoën:
Brute Force Determinization of NFAs by Means of State Covers.
CIAA 2004: 80-89 |
| 4 | EE | Jean-Marc Champarnaud,
Fabien Coulon,
Thomas Paranthoën:
Compact and fast algorithms for safe regular expression search.
Int. J. Comput. Math. 81(4): 383-401 (2004) |
| 3 | EE | Jean-Marc Champarnaud,
Fabien Coulon:
NFA reduction algorithms by means of regular inequalities.
Theor. Comput. Sci. 327(3): 241-253 (2004) |
| 2003 |
|---|
| 2 | EE | Jean-Marc Champarnaud,
Fabien Coulon:
NFA Reduction Algorithms by Means of Regular Inequalities.
Developments in Language Theory 2003: 194-205 |
| 1 | EE | Jean-Marc Champarnaud,
Fabien Coulon:
Theoretical study and implementation of the canonical automaton.
Fundam. Inform. 55(1): 23-38 (2003) |
