#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2008

2013

- This year (0)
- Last 5 years (7)
- Last 10 years (12)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne
- Discrete Mathematics & Theoretical Computer…
- 2013

- Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne, Ludovic Mignot
- Fundam. Inform.
- 2013

The aim of this paper is to design the polynomial construction of a finite recognizer for hairpin completions of regular languages. This is achieved by considering completions as new expression operators and by applying derivation techniques to the associated extended expressions called hairpin expressions. More precisely, we extend partial derivation of… (More)

- Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne
- Int. J. Found. Comput. Sci.
- 2009

- Jean-Marc Champarnaud, Hadrien Jeanne, Ludovic Mignot
- Discrete Mathematics & Theoretical Computer…
- 2013

Our aim is to construct a finite automaton recognizing the set of words that are at a bounded distance from some word of a given regular language. We define new regular operators, the similarity operators, based on a generalization of the notion of distance and we introduce the family of regular expressions extended to similarity operators, that we call… (More)

- Jean-Marc Champarnaud, Quentin Cohen-Solal, Jean-Philippe Dubernard, Hadrien Jeanne
- Electr. J. Comb.
- 2013

The aim of this paper is to gather several new results concerning the enumeration of specific classes of polycubes. We first consider two classes of 3-dimensional vertically-convex directed polycubes: the plateau polycubes and the parallelogram polycubes. An expression of the generating function is provided for the former class, as well as an asymptotic… (More)

- Jean-Marc Champarnaud, Jean-Philippe Dubernard, Franck Guingne, Hadrien Jeanne
- Theor. Comput. Sci.
- 2012

Given an arbitrarily large alphabet Σ , we consider the family of regular languages over Σ for which the deterministic minimal automaton has a strongly connected state diagram. We present a new method for checking whether such a language is semi-geometrical or not and whether it is geometrical or not. This method makes use of the enumeration of the simple… (More)