From Regular Tree Expression to Position Tree Automaton. - Éric Laugerotte; Nadia Ouali Sebti; Djelloul Ziadi (LATA, 2013)

An Efficient Algorithm for the Equation Tree Automaton via the k-C-Continuations. - Ludovic Mignot; Nadia Ouali Sebti; Djelloul Ziadi (CiE, 2014)

$k$-Position, Follow, Equation and $k$-C-Continuation Tree Automata Constructions. - Ludovic Mignot; Nadia Ouali Sebti; Djelloul Ziadi (AFL, 2014)

Bottom Up Quotients and Residuals for Tree Languages. - Jean-Marc Champarnaud; Ludovic Mignot; Nadia Ouali Sebti; Djelloul Ziadi (CoRR, 2015)

Root-Weighted Tree Automata and their Applications to Tree Kernels. - Ludovic Mignot; Nadia Ouali Sebti; Djelloul Ziadi (CoRR, 2015)

Algorithm for the k-Position Tree Automaton Construction. - Nadia Ouali Sebti; Djelloul Ziadi (CoRR, 2015)

Tree Automata Constructions from Regular Expressions: a Comparative Study. - Ludovic Mignot; Nadia Ouali Sebti; Djelloul Ziadi (Fundam. Informaticae, 2017)

Bottom-Up Quotients for Tree Languages. - Jean-Marc Champarnaud; Ludovic Mignot; Nadia Ouali Sebti; Djelloul Ziadi (J. Autom. Lang. Comb., 2017)

An Efficient Algorithm for the Construction of the Equation Tree Automaton. - Ludovic Mignot; Nadia Ouali Sebti; Djelloul Ziadi (Int. J. Found. Comput. Sci., 2018)