arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0010015cs.PLcs.CC
收藏

关于属性文法循环问题的指数时间完备性

On Exponential-Time Completeness of the Circularity Problem for Attribute Grammars

Pei-Chi Wu

摘要:

属性文法是定义程序设计语言语义的一种形式化技术。已有的关于代数循环性问题的复杂性证明都是基于自动机理论的,如写下推接受器和交替图灵机。他们将上述自动机的接受问题,即指数时间(EXPTIME)完全的问题,简化为AG循环问题。因此,这些证明表明循环问题是EXPTIME困难的,至少和EXPTIME中最困难的问题一样困难。然而,没有人给出了一个证明的EXPTIME-完全的问题。本文首先提出了一种求解圆问题的交替式图灵机。交替图灵机需要多项式空间。因此,循环性问题是EXPTIME中的,并且是EXPTIME完全的。

英文摘要:

Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata theory, such as writing pushdown acceptor and alternating Turing machines. They reduced the acceptance problems of above automata, which are exponential-time (EXPTIME) complete, to the AG circularity problem. These proofs thus show that the circularity problem is EXPTIME-hard, at least as hard as the most difficult problems in EXPTIME. However, none has given a proof for the EXPTIME-completeness of the problem. This paper first presents an alternating Turing machine for the circularity problem. The alternating Turing machine requires polynomial space. Thus, the circularity problem is in EXPTIME and is then EXPTIME-complete.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑