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 Gluskov’s one and on the one by Ilie and Yu 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, something which cannot be done with classical top-down approaches.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have