剩余有限树自动机
Residual Finite Tree Automata
摘要：
基于树自动机的算法在计算机科学的验证、规格说明、程序分析等许多领域都是必不可少的。随着XML等标准的发展，它们对于数据库也变得至关重要。本文定义了一类新的非确定树自动机，即剩余有限树自动机（RFTA）。在自底向上的情况下，我们得到了一个新的正则树语言的特征。在自顶向下的情况下，我们得到一个子类的正规树语言，其中包含的类的语言识别的确定性自顶向下树自动机。RFTA还具有规范非确定树自动机的存在性。
英文摘要：
Tree automata based algorithms are essential in many fields in computer science such as verification, specification, program analysis. They become also essential for databases with the development of standards such as XML. In this paper, we define new classes of non deterministic tree automata, namely residual finite tree automata (RFTA). In the bottom-up case, we obtain a new characterization of regular tree languages. In the top-down case, we obtain a subclass of regular tree languages which contains the class of languages recognized by deterministic top-down tree automata. RFTA also come with the property of existence of canonical non deterministic tree automata.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
