Jean-Philippe Dubernard

According to our database1, Jean-Philippe Dubernard authored at least 19 papers between 1994 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Enumeration of parallelogram polycubes.
CoRR, 2021

2019
Geometrical Closure of Binary V_3/2 Languages.
Proceedings of the Language and Automata Theory and Applications, 2019

2015
Enumeration of Polycubes and Dirichlet Convolutions.
J. Integer Seq., 2015

Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions.
Fundam. Informaticae, 2015

2013
A generic method for the enumeration of various classes of directed polycubes.
Discret. Math. Theor. Comput. Sci., 2013

Enumeration of Specific Classes of Polycubes.
Electron. J. Comb., 2013

2012
Geometrical regular languages and linear Diophantine equations: The strongly connected case.
Theor. Comput. Sci., 2012

Decidability of Geometricity of Regular Languages.
Proceedings of the Developments in Language Theory - 16th International Conference, 2012

2011
Geometrical Regular Languages and Linear Diophantine Equations.
Proceedings of the Descriptional Complexity of Formal Systems, 2011

2010
Regular Geometrical Languages and Tiling the Plane.
Proceedings of the Implementation and Application of Automata, 2010

Geometricity of Binary Regular Languages.
Proceedings of the Language and Automata Theory and Applications, 2010

2009
An Efficient Algorithm to Test Whether a Binary and Prolongeable Regular Language is Geometrical.
Int. J. Found. Comput. Sci., 2009

2008
Testing Whether a Binary and Prolongeable Regular Language LIs Geometrical or Not on the Minimal Deterministic Automaton of Pref(L).
Proceedings of the Implementation and Applications of Automata, 2008

2007
Geometrical Languages.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

2004
Scheduling hard sporadic tasks with regular languages and generating functions.
Theor. Comput. Sci., 2004

2001
Scheduling Hard Sporadic Tasks by Means of Finite Automata and Generating Functions.
Proceedings of the Implementation and Application of Automata, 2001

1996
Enumération de polyominos convexes dirigés.
Discret. Math., 1996

1995
Parallelogram Polyominoes and Corners.
J. Symb. Comput., 1995

1994
q-Grammars: Results, Implementation.
Proceedings of the STACS 94, 1994


  Loading...