13 citations · 25 across the 19 of their papers we have counts for
5 papers · 1 filter
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…
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…
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…