The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable

机译：由任意二级递推方案给出的树的单子二阶理论是可以确定的

获取原文

获取原文并翻译 | 示例

页面导航

摘要
著录项
相似文献
相关主题

摘要

A tree automaton can simulate the successful runs of a word or tree automaton working on the word or tree denoted by a level-2 lambda-tree. In particular the monadic second order theory of trees given by arbitrary, rather than only by safe, recursion schemes of level 2 is decidable. This solves the level-2 case of an open problem by Knapik, Niwinski and Urzyczyn.

机译：树自动机可以模拟在由2级lambda树表示的单词或树上工作的单词或树自动机的成功运行。特别是，可以确定由任意（而不是仅由安全）递归级别2的树木的单子二阶理论。这解决了Knapik，Niwinski和Urzyczyn提出的公开问题的2级情况。

著录项

来源
《International Conference Typed Lambda Calculi and Applications(TLCA 2005); 20050421-23; Nara(JP)》|2005年|P.38-54|共17页
会议地点 Nara(JP)
作者
Klaus Aehlig; Jolie G. de Miranda; C.-H. Luke Ong;
展开▼
作者单位

Oxford University Computing Laboratory, Wolfson Building, Parks Road, Oxford OX1 3QD, UK;

展开▼
会议组织
原文格式 PDF
正文语种 eng
中图分类理论、方法;
关键词

相似文献

外文文献
中文文献
专利

1. The Hoare Logic of Deterministic and Nondeterministic Monadic Recursion Schemes [J] . Mamouras Konstantinos ACM transactions on computational logic . 2016,第2期

机译：确定性和非确定性单子递归方案的Hoare逻辑
2. Infinite and Bi-infinite Words with Decidable Monadic Theories [J] . Moskvina Anastasia, Liu Jiamou, Kuske Dietrich Logical Methods in Computer Science . 2018,第3期

机译：具有确定性一元论的无限和双无限词
3. Infinite and Bi-infinite Words with Decidable Monadic Theories [J] . Dietrich Kuske, Jiamou Liu, Anastasia Moskvina LIPIcs : Leibniz International Proceedings in Informatics . 2015,第1期

机译：具有确定性一元论的无限和双无限词
4. The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable [C] . International Conference Typed Lambda Calculi and Applications . 2005

机译：由任意水平二级递归方案给出的树木的半阶二阶理论是可判定的
5. Value recursion in monadic computations. [D] . Erkok, Levent. 2002

机译：一元计算中的值递归。
6. Recursion-Transform method to a non-regular m×n cobweb with an arbitrary longitude [O] . Zhi-Zhong Tan -1

机译：对具有任意经度的非规则m×n蜘蛛网的递归变换方法
7. On the Hoare theory of monadic recursion schemes [O] . Konstantinos Mamouras 2014

机译：关于monadic递归方案的Hoare理论
8. The Inclusion Problem for Monadic Recursion Schemes [R] . Friedman, E. P. 1973

机译：monadic递归方案的包含问题

The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable

摘要

著录项

相似文献

相关主题

期刊订阅