677 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Université de Rouen NormandieFR107 papers
- Normandie UniversitéFR51 papers
- Institut National des Sciences Appliquées Rouen NormandieFR42 papers
- Centre National de la Recherche ScientifiqueFR32 papers
- Laboratoire d'Informatique Gaspard-MongeFR11 papers
- GREYCFR9 papers
- Institut national de recherche en sciences et technologies du numériqueFR9 papers
- Criteo (France)FR8 papers
- Observatoire de la Côte d’AzurFR7 papers
- Université Le Havre NormandieFR7 papers
- Laboratoire d'étude de l'apprentissage et du développementFR5 papers
- Laboratoire d'Informatique de l'École PolytechniqueFR5 papers
17 papers · 1 filter
Monadic Expressions and their Derivatives
Samira Attou, Ludovic Mignot, Clément Miklarz +1
We propose another interpretation of well-known derivatives computations from regular expressions, due to Brzozowski, Antimirov or Lombardy and Sakarovitch, in order to abstract th…
State complexity of the star of a Boolean operation
Pascal Caron, Edwin Hamel-de-le court, Jean-Gabriel Luque
Monsters and modifiers are two concepts recently developed in the state complexity theory. A monster is an automaton in which every function from states to states is represented by…
Algebraic and Combinatorial Tools for State Complexity : Application to the Star-Xor Problem
Pascal Caron, Edwin Hamel-de le Court, Jean-Gabriel Luque
We investigate the state complexity of the star of symmetrical differences using modifiers and monsters. A monster is an automaton in which every function from states to states is…
New tools for state complexity
Pascal Caron, Edwin Hamel-De le court, Jean-Gabriel Luque +1
A monster is an automaton in which every function from states to states is represented by at least one letter. A modifier is a set of functions allowing one to transform a set of a…
Ten Conferences WORDS: Open Problems and Conjectures
Jean Néraud
In connection to the development of the field of Combinatorics on Words, we present a list of open problems and conjectures that were stated during the ten last meetings WORDS. We…
On the Hierarchy of Block Deterministic Languages
Pascal Caron, Ludovic Mignot, Clément Miklarz
A regular language is -lookahead deterministic (resp. -block deterministic) if it is specified by a -lookahead deterministic (resp. -block deterministic) regular expres…
Logic and Branching Automata
Bedon Nicolas
In this paper we study the logical aspects of branching automata, as defined by Lodaya and Weil. We first prove that the class of languages of finite N-free posets recognized by br…
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…
Construction of rational expression from tree automata using a generalization of Arden's Lemma
Younes Guellouma, Ludovic Mignot, Hadda Cherroun +1
Arden's Lemma is a classical result in language theory allowing the computation of a rational expression denoting the language recognized by a finite string automaton. In this pape…
An Efficient Algorithm for the Equation Tree Automaton via the -C-Continuations
Ludovic Mignot, Nadia Ouali Sebti, Djelloul Ziadi
Champarnaud and Ziadi, and Khorsi et al. show how to compute the equation automaton of word regular expression via the -C-Continuations. Kuske and Meinecke extend the comput…
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…
On the transition reduction problem for finite automata
el Houcein el Abdalaoui, Mohamed Dahmoune, Djelloul Ziadi
We are interested in the problem of transition reduction of nondeterministic automata. We present some results on the reduction of the automata recognizing the language de…
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…
Abelian Repetitions in Sturmian Words
Gabriele Fici, Alessio Langiu, Thierry Lecroq +3
We investigate abelian repetitions in Sturmian words. We exploit a bijection between factors of Sturmian words and subintervals of the unitary segment that allows us to study the p…
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,…
Some Combinatorial Operators in Language Theory
Jean-Gabriel Luque, Ludovic Mignot, Florent Nicart
Multitildes are regular operators that were introduced by Caron et al. in order to increase the number of Glushkov automata. In this paper, we study the family of the multitilde op…