1 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.FL2015★ 1 cited
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…
cs.FL2015★ 1 cited
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…