| 2009 |
|---|
| 51 | EE | Pascal Caron,
Jean-Marc Champarnaud,
Ludovic Mignot:
Multi-tilde Operators and Their Glushkov Automata.
LATA 2009: 290-301 |
| 50 | EE | Pascal Caron,
Jean-Marc Champarnaud,
Ludovic Mignot:
A New Family of Regular Operators Fitting with the Position Automaton Computation.
SOFSEM 2009: 645-655 |
| 49 | EE | Jean-Marc Champarnaud,
Faissal Ouardi,
Djelloul Ziadi:
An Efficient Computation of the Equation K-automaton of a Regular K-expression.
Fundam. Inform. 90(1-2): 1-16 (2009) |
| 2008 |
|---|
| 48 | EE | Jean-Marc Champarnaud,
Jean-Philippe Dubernard,
H. Jeanne:
Testing Whether a Binary and Prolongeable Regular Language LIs Geometrical or Not on the Minimal Deterministic Automaton of Pref(L).
CIAA 2008: 68-77 |
| 47 | 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 |
|---|
| 46 | EE | Jean-Marc Champarnaud,
Franck Guingne,
Jacques Farré:
Reducing Acyclic Cover Transducers.
CIAA 2007: 38-50 |
| 45 | EE | Jean-Marc Champarnaud,
Faissal Ouardi,
Djelloul Ziadi:
An Efficient Computation of the Equation K-Automaton of a Regular K-Expression.
Developments in Language Theory 2007: 145-156 |
| 44 | EE | Jean-Marc Champarnaud,
Faissal Ouardi,
Djelloul Ziadi:
Normalized Expressions and Finite Automata.
IJAC 17(1): 141-154 (2007) |
| 43 | EE | Florent Nicart,
Jean-Marc Champarnaud,
Tibor Csáki,
Tamás Gaál,
André Kempe:
Labelling Multi-Tape Automata with Constrained Symbol Classes.
Int. J. Found. Comput. Sci. 18(4): 847-858 (2007) |
| 2006 |
|---|
| 42 | EE | Florent Nicart,
Jean-Marc Champarnaud,
Tibor Csáki,
Tamás Gaál,
André Kempe:
Multi-tape Automata with Symbol Classes.
CIAA 2006: 126-136 |
| 41 | EE | Jean-Marc Champarnaud,
Florent Nicart,
Djelloul Ziadi:
From the ZPC Structure of a Regular Expression to its Follow Automaton.
IJAC 16(1): 17-34 (2006) |
| 2005 |
|---|
| 40 | EE | André Kempe,
Jean-Marc Champarnaud,
Jason Eisner,
Franck Guingne,
Florent Nicart:
A Class of Rational n-WFSM Auto-intersections.
CIAA 2005: 188-198 |
| 39 | EE | André Kempe,
Jean-Marc Champarnaud,
Franck Guingne,
Florent Nicart:
WFSM Auto-intersection and Join Algorithms.
FSMNLP 2005: 120-131 |
| 38 | 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) |
| 37 | 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) |
| 36 | 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) |
| 35 | EE | Jean-Marc Champarnaud,
Thomas Paranthoën:
Random generation of DFAs.
Theor. Comput. Sci. 330(2): 221-235 (2005) |
| 34 | 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 |
|---|
| 33 | EE | Jean-Marc Champarnaud,
Fabien Coulon,
Thomas Paranthoën:
Brute Force Determinization of NFAs by Means of State Covers.
CIAA 2004: 80-89 |
| 32 | EE | Jean-Marc Champarnaud,
Florent Nicart,
Djelloul Ziadi:
Computing the Follow Automaton of an Expression.
CIAA 2004: 90-101 |
| 31 | EE | Jean-Marc Champarnaud,
Georges Hansel,
Dominique Perrin:
Unavoidable Sets of Constant Length.
IJAC 14(2): 241-251 (2004) |
| 30 | 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) |
| 29 | EE | Jean-Marc Champarnaud,
Éric Laugerotte,
Faissal Ouardi,
Djelloul Ziadi:
From Regular Weighted Expressions To Finite Automata.
Int. J. Found. Comput. Sci. 15(5): 687-700 (2004) |
| 28 | | Jean-Marc Champarnaud,
Georges Hansel,
Thomas Paranthoën,
Djelloul Ziadi:
Random Generation Models for NFAs.
Journal of Automata, Languages and Combinatorics 9(2/3): 203-216 (2004) |
| 27 | EE | Jean-Marc Champarnaud,
Gérard Duchamp:
Derivatives of rational expressions and related theorems.
Theor. Comput. Sci. 313(1): 31-44 (2004) |
| 26 | EE | Jean-Marc Champarnaud,
Fabien Coulon:
NFA reduction algorithms by means of regular inequalities.
Theor. Comput. Sci. 327(3): 241-253 (2004) |
| 2003 |
|---|
| 25 | | Jean-Marc Champarnaud,
Denis Maurel:
Implementation and Application of Automata, 7th International Conference, CIAA 2002, Tours, France, July 3-5, 2002, Revised Papers
Springer 2003 |
| 24 | EE | Jean-Marc Champarnaud,
Éric Laugerotte,
Faissal Ouardi,
Djelloul Ziadi:
From Regular Weighted Expressions to Finite Automata.
CIAA 2003: 49-60 |
| 23 | EE | Jean-Marc Champarnaud,
Fabien Coulon:
NFA Reduction Algorithms by Means of Regular Inequalities.
Developments in Language Theory 2003: 194-205 |
| 22 | EE | Jean-Marc Champarnaud,
Fabien Coulon:
Theoretical study and implementation of the canonical automaton.
Fundam. Inform. 55(1): 23-38 (2003) |
| 21 | 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 |
|---|
| 20 | EE | Jean-Marc Champarnaud:
Evaluation of Three Implicit Structures to Implement Nondeterministic Automata From Regular Expressions.
Int. J. Found. Comput. Sci. 13(1): 99-113 (2002) |
| 19 | | Jean-Marc Champarnaud,
Djelloul Ziadi:
Canonical derivatives, partial derivatives and finite automaton constructions.
Theor. Comput. Sci. 289(1): 137-163 (2002) |
| 2001 |
|---|
| 18 | EE | Jean-Marc Champarnaud,
Gérard Duchamp:
Brzozowski's Derivatives Extended to Multiplicities.
CIAA 2001: 52-64 |
| 17 | EE | Jean-Marc Champarnaud,
Djelloul Ziadi:
Computing the Equation Automaton of a Regular Expression in Space and Time.
CPM 2001: 157-168 |
| 16 | | Jean-Marc Champarnaud,
Djelloul Ziadi:
From Mirkin's Prebases to Antimirov's Word Partial Derivatives.
Fundam. Inform. 45(3): 195-205 (2001) |
| 15 | EE | Jean-Marc Champarnaud,
Djelloul Ziadi:
From C-Continuations to New Quadratic Algorithms for Automaton Synthesis.
IJAC 11(6): 707-736 (2001) |
| 14 | EE | Jean-Marc Champarnaud,
Denis Maurel,
Djelloul Ziadi:
Foreword.
Theor. Comput. Sci. 267(1-2): 1 (2001) |
| 13 | EE | Jean-Marc Champarnaud:
Subset construction complexity for homogeneous automata, position automata and ZPC-structures.
Theor. Comput. Sci. 267(1-2): 17-34 (2001) |
| 2000 |
|---|
| 12 | EE | Jean-Marc Champarnaud:
Implicit Structures to Implement NFA's from Regular Expressions.
CIAA 2000: 80-93 |
| 11 | EE | Jean-Marc Champarnaud,
Djelloul Ziadi:
New Finite Automaton Constructions Based on Canonical Derivatives.
CIAA 2000: 94-104 |
| 1999 |
|---|
| 10 | | Jean-Marc Champarnaud,
Denis Maurel,
Djelloul Ziadi:
Automata Implementation, Third International Workshop on Implementing Automata, WIA'98, Rouen, France, September 17-19, 1998, Revised Papers
Springer 1999 |
| 9 | EE | Philippe Andary,
Pascal Caron,
Jean-Marc Champarnaud,
Gérard Duchamp,
Marianne Flouret,
Éric Laugerotte:
SEA: A Symbolic Environment for Automata Theory.
WIA 1999: 13-26 |
| 8 | EE | Djelloul Ziadi,
Jean-Marc Champarnaud:
An Optimal Parallel Algorithm to Convert a Regular Expression into its Glushkov Automaton.
Theor. Comput. Sci. 215(1-2): 69-87 (1999) |
| 1998 |
|---|
| 7 | EE | Jean-Francis Michon,
Jean-Marc Champarnaud:
Automata and Binary Decision Diagrams.
Workshop on Implementing Automata 1998: 178-182 |
| 6 | EE | Are Uppman,
Jean-Marc Champarnaud:
Autographe: A Graphical Version of Automate.
Workshop on Implementing Automata 1998: 226-229 |
| 5 | EE | Jean-Marc Champarnaud,
Djelloul Ziadi,
Jean-Luc Ponty:
Determinization of Glushkov Automata.
Workshop on Implementing Automata 1998: 57-68 |
| 1996 |
|---|
| 4 | | Jean-Luc Ponty,
Djelloul Ziadi,
Jean-Marc Champarnaud:
A New Quadratic Algorithm to Convert a Regular Expression into an Automaton.
Workshop on Implementing Automata 1996: 109-119 |
| 1992 |
|---|
| 3 | | Jean-Marc Champarnaud:
A Programming Language for Symbolic Computation of Regular Languages, Automata and Semigroups.
STACS 1992: 605-606 |
| 1991 |
|---|
| 2 | | Jean-Marc Champarnaud,
Georges Hansel:
AUTOMATE, a Computing Package for Automata and Finite Semigroups.
J. Symb. Comput. 12(2): 197-220 (1991) |
| 1989 |
|---|
| 1 | EE | Jean-Marc Champarnaud,
Jean-Eric Pin:
A maxmin problem on finite automata.
Discrete Applied Mathematics 23(1): 91-96 (1989) |
