13 citations · 17 across the 5 of their papers we have counts for
6 papers
Bottom Up Quotients and Residuals for Tree Languages
Jean-Marc Champarnaud, Ludovic Mignot, Nadia Ouali-Sebti +1
In this paper, we extend the notion of tree language quotients to bottom-up quotients. Instead of computing the residual of a tree language from top to bottom and producing a list…
Constrained Expressions and their Derivatives
Jean-Marc Champarnaud, Ludovic Mignot, Florent Nicart
This paper proposes an extension to classical regular expressions by the addition of two operators allowing the inclusion of boolean formulae from the zeroth order logic. These exp…
Extended to Multi-Tilde-Bar Regular Expressions and Efficient Finite Automata Constructions
Jean-Marc Champarnaud, Faissal Ouardi, Djelloul Ziadi
Several algorithms have been designed to convert a regular expression into an equivalent finite automaton. One of the most popular constructions, due to Glushkov and to McNaughton…
Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions
Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne +1
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 n…
A General Framework for the Derivation of Regular Expressions
Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot
The aim of this paper is to design a theoretical framework that allows us to perform the computation of regular expression derivatives through a space of generic structures. Thanks…
Derivatives of Approximate Regular Expressions
Jean-Marc Champarnaud, Hadrien Jeanne, Ludovic Mignot
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,…