一阶树到树函数
First-order tree-to-tree functions
摘要:
我们研究可以在一阶逻辑或一元二阶逻辑中定义的树到树变换。我们证明了一个分解定理,它表明,每一个变换可以得到从素变换,如树到树的同态或前序遍历,通过使用组合子,如功能组合。
英文摘要:
We study tree-to-tree transformations that can be defined in first-order logic or monadic second-order logic. We prove a decomposition theorem, which shows that every transformation can be obtained from prime transformations, such as tree-to-tree homomorphisms or pre-order traversal, by using combinators such as function composition.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。