广义不确定性的正则可实现性问题和模型
Regular realizability problems and models of a generalized nondeterminism
摘要:
广义非确定性的模型由对计算设备的非确定性行为的限制来定义。正则可实现性问题是在正则语言中验证特殊排序字的存在性的问题。这些概念是紧密相连的。在本文中,我们考虑的正则可实现性问题的语言组成的所有前缀的一个无限词。这些问题与无限词上的自动机和一元二阶理论的可判定性有关。主要贡献是一个新的判定条件,经常实现问题和单子二阶理论。我们还证明了正则可实现问题的可判定性等价于某些前缀可实现问题的可判定性。
英文摘要:
Models of a generalized nondeterminism are defined by limitations on nonde- terministic behavior of a computing device. A regular realizability problem is a problem of verifying existence of a special sort word in a regular language. These notions are closely connected. In this paper we consider regular realizability problems for languages consist- ing of all prefixes of an infinite word. These problems are related to the automata on infinite words and to the decidability of monadic second-order theories. The main contribution is a new decidability condition for regular realizability problems and for monadic-second order theories. We also show that decidability of a regular realizability problem is equivalent to decidability of some prefix realizability problem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。