7 citations · 10 across the 7 of their papers we have counts for
5 papers · 1 filter
Bottom-Up Derivatives of Tree Expressions
Samira Attou, Ludovic Mignot, Djelloul Ziadi
In this paper, we extend the notion of (word) derivatives and partial derivatives due to (respectively) Brzozowski and Antimirov to tree derivatives using already known inductive f…
The Bottom-Up Position Tree Automaton, the Father Automaton and their Compact Versions
Samira Attou, Ludovic Mignot, Djelloul Ziadi
The conversion of a given regular tree expression into a tree automaton has been widely studied. However, classical interpretations are based upon a Top-Down interpretation of tree…
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…
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…