1 citations · 1 across the 4 of their papers we have counts for
5 papers · 1 filter
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…
Algorithm for the k-Position Tree Automaton Construction
Nadia Ouali Sebti, Djelloul Ziadi
The word position automaton was introduced by Glushkov and McNaughton in the early 1960. This automaton is homogeneous and has (||\E||+1) states for a word expression of alphabetic…
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…
K-Position, Follow, Equation and K-C-Continuation Tree Automata Constructions
Ludovic Mignot, Nadia Ouali Sebti, Djelloul Ziadi
There exist several methods of computing an automaton recognizing the language denoted by a given regular expression: In the case of words, the position automaton P due to Glushkov…
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…