 | 2009 |
|---|
| 7 |       | Jean-Marc Champarnaud,
Jean-Philippe Dubernard,
Hadrien Jeanne:
An Efficient Algorithm to Test Whether a Binary and Prolongeable Regular Language is Geometrical.
Int. J. Found. Comput. Sci. 20(4): 763-774 (2009) |
| 2008 |
|---|
| 6 | | Jean-Marc Champarnaud,
Jean-Philippe Dubernard,
Hadrien 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 |
| 2004 |
|---|
| 5 | | Dominique Geniet,
Jean-Philippe Dubernard:
Scheduling hard sporadic tasks with regular languages and generating functions.
Theor. Comput. Sci. 313(1): 119-132 (2004) |
| 2001 |
|---|
| 4 | | Jean-Philippe Dubernard,
Dominique Geniet:
Scheduling Hard Sporadic Tasks by Means of Finite Automata and Generating Functions.
CIAA 2001: 87-100 |
| 1996 |
|---|
| 3 | | Jean-Philippe Dubernard,
I. Dutour:
Enumération de polyominos convexes dirigés.
Discrete Mathematics 157(1-3): 79-90 (1996) |
| 1995 |
|---|
| 2 |  | Maylis Delest,
Jean-Philippe Dubernard,
I. Dutour:
Parallelogram Polyominoes and Corners.
J. Symb. Comput. 20(5/6): 503-515 (1995) |
| 1994 |
|---|
| 1 | | Maylis Delest,
Jean-Philippe Dubernard:
q-Grammars: Results, Implementation.
STACS 1994: 377-388 |
