证明不可表达性
Certifying Inexpressibility
摘要:
不同类型的无穷词自动机具有不同的表达能力。决定给定语言$L \subseteq Σ^ω$是否可以由期望类的自动机表示可以简化为决定证明者和反驳者之间的游戏:在游戏的每一轮中,反驳者提供一个$Σ$中的字母,而证明者则用当前运行状态的注释进行响应(例如,在Büchi自动机的情况下,状态是接受还是拒绝,在奇偶自动机的情况下,状态的颜色是什么)。如果她生成的注释序列正确,则证明者获胜:如果Refuter生成的单词在$L$中,则它是一个接受运行。我们展示了如何一个成功的策略反驳可以作为一个简单和易于理解的证书,以不可表达性,以及它如何诱导其他形式的证书。我们的框架可以处理所有类型的确定性自动机,包括具有结构限制的自动机,如弱自动机。此外,它可以用于反驳分离两种语言的自动机所需的类,并寻找自动机,近似$L$和属于所需的类。
英文摘要:
Different classes of automata on infinite words have different expressive power. Deciding whether a given language $L \subseteq Σ^ω$ can be expressed by an automaton of a desired class can be reduced to deciding a game between Prover and Refuter: in each turn of the game, Refuter provides a letter in $Σ$, and Prover responds with an annotation of the current state of the run (for example, in the case of Büchi automata, whether the state is accepting or rejecting, and in the case of parity automata, what the color of the state is). Prover wins if the sequence of annotations she generates is correct: it is an accepting run iff the word generated by Refuter is in $L$. We show how a winning strategy for Refuter can serve as a simple and easy-to-understand certificate to inexpressibility, and how it induces additional forms of certificates. Our framework handles all classes of deterministic automata, including ones with structural restrictions like weak automata. In addition, it can be used for refuting separation of two languages by an automaton of the desired class, and for finding automata that approximate $L$ and belong to the desired class.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。