Nadia Ouali Sebti

According to our database, Nadia Ouali Sebti authored at least 9 papers between 2013 and 2018.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2018

An Efficient Algorithm for the Construction of the Equation Tree Automaton.

Ludovic Mignot, Nadia Ouali Sebti, Djelloul Ziadi

Int. J. Found. Comput. Sci., 2018

2017

Bottom-Up Quotients for Tree Languages.

Jean-Marc Champarnaud, Ludovic Mignot, Nadia Ouali Sebti, Djelloul Ziadi

J. Autom. Lang. Comb., 2017

Tree Automata Constructions from Regular Expressions: a Comparative Study.

Ludovic Mignot, Nadia Ouali Sebti, Djelloul Ziadi

Fundam. Informaticae, 2017

2015

Algorithm for the k-Position Tree Automaton Construction.

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

Bottom Up Quotients and Residuals for Tree Languages.

Jean-Marc Champarnaud, Ludovic Mignot, Nadia Ouali Sebti, Djelloul Ziadi

CoRR, 2015

2014

$k$-Position, Follow, Equation and $k$-C-Continuation Tree Automata Constructions.

Ludovic Mignot, Nadia Ouali Sebti, Djelloul Ziadi

Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

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

Ludovic Mignot, Nadia Ouali Sebti, Djelloul Ziadi

Proceedings of the Language, Life, Limits - 10th Conference on Computability in Europe, 2014

2013

From Regular Tree Expression to Position Tree Automaton.

Éric Laugerotte, Nadia Ouali Sebti, Djelloul Ziadi

Proceedings of the Language and Automata Theory and Applications, 2013