树语言的自底向上的商和余
Bottom Up Quotients and Residuals for Tree Languages
摘要:
在本文中,我们扩展的概念树语言的自底向上而不是从上到下计算树语言的残差并产生树语言列表,我们展示了如何计算一组k元树,其中k是任意整数。我们定义的商公式的不同组合的树语言:工会,符号产品,组合,迭代符号产品和迭代组合。这些计算导致自下而上的商树自动机的定义,这原来是最小的确定性树自动机的情况下,0元树与正规树语言。
英文摘要:
In this paper, we extend the notion of tree language quotients to bottom-up quotients. Instead of computing the residual of a tree language from top to bottom and producing a list of tree languages, we show how to compute a set of k-ary trees, where k is an arbitrary integer. We define the quotient formula for different combinations of tree languages: union, symbol products, compositions, iterated symbol products and iterated composition. These computations lead to the definition of the bottom-up quotient tree automaton, that turns out to be the minimal deterministic tree automaton associated with a regular tree language in the case of the 0-ary trees.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。