3 citations · 5 across the 5 of their papers we have counts for
5 papers · 1 filter
State complexity of catenation combined with a boolean operation: a unified approach
Pascal Caron, Jean-Gabriel Luque, Ludovic Mignot +1
In this paper we study the state complexity of catenation combined with symmetric difference. First, an upper bound is computed using some combinatoric tools. Then, this bound is s…
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…
Root-Weighted Tree Automata and their Applications to Tree Kernels
Ludovic Mignot, Nadia Ouali-Sebti, Djelloul Ziadi
In this paper, we define a new kind of weighted tree automata where the weights are only supported by final states. We show that these automata are sequentializable and we study th…
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…