| 2009 |
|---|
| 25 | 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 |
|---|
| 24 | EE | Éric Laugerotte,
Djelloul Ziadi:
WeightedWord Recognition.
Fundam. Inform. 83(3): 277-298 (2008) |
| 23 | EE | Ahmed Khorsi,
Faissal Ouardi,
Djelloul Ziadi:
Fast equation automaton computation.
J. Discrete Algorithms 6(3): 433-448 (2008) |
| 2007 |
|---|
| 22 | 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 |
| 21 | EE | Jean-Marc Champarnaud,
Faissal Ouardi,
Djelloul Ziadi:
Normalized Expressions and Finite Automata.
IJAC 17(1): 141-154 (2007) |
| 2006 |
|---|
| 20 | 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) |
| 2004 |
|---|
| 19 | EE | Jean-Marc Champarnaud,
Florent Nicart,
Djelloul Ziadi:
Computing the Follow Automaton of an Expression.
CIAA 2004: 90-101 |
| 18 | EE | Dora Giammarresi,
Jean-Luc Ponty,
Derick Wood,
Djelloul Ziadi:
A characterization of Thompson digraphs.
Discrete Applied Mathematics 134(1-3): 317-337 (2004) |
| 17 | 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) |
| 16 | | 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) |
| 2003 |
|---|
| 15 | EE | Jean-Marc Champarnaud,
Éric Laugerotte,
Faissal Ouardi,
Djelloul Ziadi:
From Regular Weighted Expressions to Finite Automata.
CIAA 2003: 49-60 |
| 2002 |
|---|
| 14 | | Jean-Marc Champarnaud,
Djelloul Ziadi:
Canonical derivatives, partial derivatives and finite automaton constructions.
Theor. Comput. Sci. 289(1): 137-163 (2002) |
| 2001 |
|---|
| 13 | EE | Jean-Marc Champarnaud,
Djelloul Ziadi:
Computing the Equation Automaton of a Regular Expression in Space and Time.
CPM 2001: 157-168 |
| 12 | | Jean-Marc Champarnaud,
Djelloul Ziadi:
From Mirkin's Prebases to Antimirov's Word Partial Derivatives.
Fundam. Inform. 45(3): 195-205 (2001) |
| 11 | EE | Jean-Marc Champarnaud,
Djelloul Ziadi:
From C-Continuations to New Quadratic Algorithms for Automaton Synthesis.
IJAC 11(6): 707-736 (2001) |
| 10 | EE | Jean-Marc Champarnaud,
Denis Maurel,
Djelloul Ziadi:
Foreword.
Theor. Comput. Sci. 267(1-2): 1 (2001) |
| 2000 |
|---|
| 9 | EE | Jean-Marc Champarnaud,
Djelloul Ziadi:
New Finite Automaton Constructions Based on Canonical Derivatives.
CIAA 2000: 94-104 |
| 8 | EE | Djelloul Ziadi:
Sorting and Doubling Techniques for Set Partitioning and Automata Minimization Problems.
Theor. Comput. Sci. 231(1): 75-87 (2000) |
| 7 | EE | Pascal Caron,
Djelloul Ziadi:
Characterization of Glushkov automata.
Theor. Comput. Sci. 233(1-2): 75-90 (2000) |
| 1999 |
|---|
| 6 | | 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 |
| 5 | 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 |
|---|
| 4 | EE | Jean-Marc Champarnaud,
Djelloul Ziadi,
Jean-Luc Ponty:
Determinization of Glushkov Automata.
Workshop on Implementing Automata 1998: 57-68 |
| 1997 |
|---|
| 3 | | Djelloul Ziadi:
Sorting and Doubling Techniques for Set Partitioning and Automata Minimization Problems.
Workshop on Implementing Automata 1997: 241-251 |
| 1996 |
|---|
| 2 | | 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 |
| 1 | EE | Djelloul Ziadi:
Regular Expression for a Language without Empty Word.
Theor. Comput. Sci. 163(1&2): 309-315 (1996) |
