IDEALIZED ALGOL WITH GROUND RECURSION

Dpda Equivalence,A. S. Murawski,I. Walukiewicz

msra

引用 24|浏览12
暂无评分
摘要
ABSTRACT. WE PROVE THAT OBSERVATIONAL EQUIVALENCE OF IA3 + Y0 (3RD-ORDER IDEALIZED ALGOL WITH 0TH-ORDER RECURSION) IS EQUIVALENT TO THE DPDA EQUIVALENCE PROBLEM, AND HENCE DECIDABLE. THIS COMPLETES THE CLASSI-CATION OF DECIDABLE FRAGMENTS OF IDEALIZED ALGOL. WE ALSO PROVE THAT OB-SERVATIONAL APPROXIMATION OF IA1 + Y0 IS UNDECIDABLE BY REDUCING THE DPDA CONTAINMENT PROBLEM TO IT.
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要