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.

中文翻译：

---

自下而上的位置树自动机和父自动机

将给定的正则树表达式转换为树自动机已被广泛研究。然而，经典解释是基于对树自动机的自上而下的解释。在本文中，我们提出了基于 Gluskov 的构造以及 Ilie 和 Yu 使用自下而上解释的构造的新构造。该技术的主要目标之一是下一步考虑与确定性识别器的链接，这是经典自上而下方法无法做到的。