7 citations · 12 across the 14 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.FL2014
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…
cs.FL2014
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…