| 2008 |
|---|
| 11 | EE | Jean-Marc Champarnaud,
Franck Guingne,
André Kempe,
Florent Nicart:
Algorithms for the Join and Auto-Intersection of Multi-Tape Weighted Finite-State Machines.
Int. J. Found. Comput. Sci. 19(2): 453-476 (2008) |
| 2007 |
|---|
| 10 | EE | Jean-Marc Champarnaud,
Franck Guingne,
Jacques Farré:
Reducing Acyclic Cover Transducers.
CIAA 2007: 38-50 |
| 2005 |
|---|
| 9 | EE | André Kempe,
Jean-Marc Champarnaud,
Jason Eisner,
Franck Guingne,
Florent Nicart:
A Class of Rational n-WFSM Auto-intersections.
CIAA 2005: 188-198 |
| 8 | EE | André Kempe,
Jean-Marc Champarnaud,
Franck Guingne,
Florent Nicart:
WFSM Auto-intersection and Join Algorithms.
FSMNLP 2005: 120-131 |
| 7 | EE | Jean-Marc Champarnaud,
Franck Guingne,
Georges Hansel:
Cover transducers for functions with finite domain.
Int. J. Found. Comput. Sci. 16(5): 851-865 (2005) |
| 2004 |
|---|
| 6 | EE | André Kempe,
Franck Guingne,
Florent Nicart:
Algorithms for weighted multi-tape automata
CoRR cs.CL/0406003: (2004) |
| 5 | EE | Franck Guingne,
Florent Nicart,
André Kempe:
Acyclic networks maximizing the printing complexity.
Theor. Comput. Sci. 328(1-2): 39-51 (2004) |
| 2003 |
|---|
| 4 | EE | André Kempe,
Christof Baeijs,
Tamás Gaál,
Franck Guingne,
Florent Nicart:
WFSC - A New Weighted Finite State Compiler.
CIAA 2003: 108-119 |
| 3 | EE | Franck Guingne,
André Kempe,
Florent Nicart:
Running Time Complexity of Printing an Acyclic Automaton.
CIAA 2003: 131-140 |
| 2 | EE | Franck Guingne,
Florent Nicart,
Jean-Marc Champarnaud,
Lauri Karttunen,
Tamás Gaál,
André Kempe:
Virtual Operations On Virtual Networks: The Priority Union .
Int. J. Found. Comput. Sci. 14(6): 1055-1071 (2003) |
| 2002 |
|---|
| 1 | EE | Franck Guingne,
Florent Nicart:
Finite State Lazy Operations in NLP.
CIAA 2002: 138-147 |
