The Bottom-Up Position Tree Automaton, the Father Automaton and their Compact Versions
Abstract
The conversion of a given regular tree expression into a tree automaton has been widely studied. However, classical interpretations are based upon a Top-Down interpretation of tree automata. In this paper, we propose new constructions based on the Gluskov's one and on the one of Ilie and Yu one using a Bottom-Up interpretation. One of the main goals of this technique is to consider as a next step the links with deterministic recognizers, consideration that cannot be performed with classical Top-Down approaches. Furthermore, we exhibit a method to factorize transitions of tree automata and show that this technique is particularly interesting for these constructions, by considering natural factorizations due to the structure of regular expression.
Keywords
Cite
@article{arxiv.1805.08584,
title = {The Bottom-Up Position Tree Automaton, the Father Automaton and their Compact Versions},
author = {Samira Attou and Ludovic Mignot and Djelloul Ziadi},
journal= {arXiv preprint arXiv:1805.08584},
year = {2018}
}
Comments
extended version of a paper accepted at CIAA 2018