关于树的一阶可定义集的测度计算
On Computing the Measures of First-Order Definable Sets of Trees
摘要:
我们考虑无限二叉树的正则语言的测度计算问题。虽然一般情况下仍然没有解决,我们表明,一个一阶公式定义的语言没有后代关系或由一个布尔组合的合取查询(后代关系)的措施是合理的和可计算的。此外,我们提供了一个一阶公式的例子,使用后代关系,并定义了一个语言的无限树具有无理测量。
英文摘要:
We consider the problem of computing the measure of a regular language of infinite binary trees. While the general case remains unsolved, we show that the measure of a language defined by a first-order formula with no descendant relation or by a Boolean combination of conjunctive queries (with descendant relation) is rational and computable. Additionally, we provide an example of a first-order formula that uses descendant relation and defines a language of infinite trees having an irrational measure.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。