From Regular Tree Expression to Position Tree Automaton

An Efficient Algorithm for the Equation Tree Automaton via the k-C-Continuations

“…Proposition 2 ( [9]). The computation of all the sets (Follow(E, f j , k)) 1≤k≤m,f ∈PosE (E) m can be done with an O(| E |) time and space complexity.…”

“…As far as tree automata are concerned, computation algorithms are extensions of word cases. In [9], the computation of the position tree automaton from a regular tree expression has been achieved by extending the classical notions of Glushkov functions defined in [6], leading to the computation of an automaton which number of states is linear w.r.t. the number of occurrences of symbols but which number of transitions can be exponential.…”

“…regular tree expressions) into finite automata [2,6,7,15] (resp. into finite tree automata [8,9]). As far as tree automata are concerned, computation algorithms are extensions of word cases.…”

Tree pattern matching from regular tree expressions

“…Among these works is the one of Laugerotte et al [24], who gave an algorithm to compute the position tree automaton. The work of Kuske and Meinecke [23] consists of the definition of partial derivatives for regular tree expressions and then building a non-deterministic finite tree automaton recognizing the language denoted by such an expression.…”

K-Position, Follow, Equation and K-C-Continuation Tree Automata Constructions

“…We define two new tree automata constructions, the k-position automaton and the follow automaton, and we study their morphic links with two other already known automata constructions, the equation automaton of Kuske and Meinecke [11] and our k-C-continuation automaton [14]. Notice that a position automaton and a reduced automaton have already been defined in [12]. However, they are not isomorphic with the automata we define in this paper.…”