Anzeige
Erschienen in:
2014 | OriginalPaper | Buchkapitel
An Efficient Algorithm for the Equation Tree Automaton via the k-C-Continuations
verfasst von : Ludovic Mignot, Nadia Ouali Sebti, Djelloul Ziadi
Erschienen in: Language, Life, Limits
Verlag: Springer International Publishing
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Champarnaud and Ziadi, and Khorsi
et al.
show how to compute the equation automaton of word regular expression
via
the
k
-C-Continuations. Kuske and Meinecke extend the computation of the equation automaton to a regular tree expression
over a ranked alphabet Σ and produce a
time and space complexity algorithm, where
R
is the maximal rank of a symbol occurring in Σ and
is the size of
. In this paper, we give a full description of the algorithm based on the acyclic minimization of Revuz. Our algorithm, which is performed in an
time and space complexity, where |
Q
| is the number of states of the produced automaton, is more efficient than the one obtained by Kuske and Meinecke.