![]() | ![]() |
2008 | ||
---|---|---|
6 | 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 |
2004 | ||
5 | EE | 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 | EE | Jean-Philippe Dubernard, Dominique Geniet: Scheduling Hard Sporadic Tasks by Means of Finite Automata and Generating Functions. CIAA 2001: 87-100 |
1996 | ||
3 | EE | 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 |
1 | Jean-Marc Champarnaud | [6] |
2 | Maylis Delest | [1] [2] |
3 | I. Dutour | [2] [3] |
4 | Dominique Geniet | [4] [5] |
5 | H. Jeanne | [6] |