再探双向单计数器网络
Two-Way One-Counter Nets Revisited
AI总结:
本文研究了双向单计数器网络(2-OCNs)的空性问题和表达能力,证明了有界语言和sweeping 2-OCNs下的空性可判定性,并揭示了其与半线性语言的联系,同时通过泵引理改进了语言不可识别性结果。
摘要:
单计数器网络(One Counter Nets, OCNs)是配备一个不能变为负数但不能显式测试是否为零的计数器的有限状态自动机。它们与各种其他模型(例如PDA、Vector Addition Systems和Counter Automata)的密切联系使其成为一种极具吸引力的建模工具。OCNs的双向变体(2-OCNs)于20世纪80年代被引入,并被证明比OCNs更具表达能力,以至于在确定性模型(2-DOCNs)中,空性问题已经是不可判定的。在第一部分中,我们在关于带状态向量加法系统(VASS)的现代研究成果的启发下,研究了2-OCNs自然限制下的空性问题。我们证明了在有界语言(即包含在$a_1^*a_2^*\cdots a_k^*$中的语言)上的2-OCNs的空性问题是可判定的;而对于sweeping 2-OCNs(其读写头方向仅在端点标记处改变),其空性问题是可判定的且是Ackermann完全的。这两个可判定性结果都围绕着将该问题归约到VASS可达性问题,但它们依赖于截然不同的方法。在第二部分中,我们研究了2-OCNs的表达能力,展示了有界语言、sweeping 2-OCNs和半线性语言之间的一系列联系。在这些联系中最值得注意的是,sweeping 2-OCNs识别的有界语言恰好是半线性语言。最后,我们为2-DOCNs建立了一个复杂的泵引理,并用它证明了存在OCN语言不能被2-DOCN识别,这改进了已知的存在此类2-OCN语言的结果。
英文摘要:
One Counter Nets (OCNs) are finite-state automata equipped with a counter that cannot become negative, but cannot be explicitly tested for zero. Their close connection to various other models (e.g., PDAs, Vector Addition Systems, and Counter Automata) make them an attractive modeling tool. The two-way variant of OCNs (2-OCNs) was introduced in the 1980's and shown to be more expressive than OCNs, so much so that the emptiness problem is undecidable already in the deterministic model (2-DOCNs). In a first part, we study the emptiness problem of natural restrictions of 2-OCNs, under the light of modern results about Vector Addition System with States (VASS). We show that emptiness is decidable for 2-OCNs over \emph{bounded languages} i.e., languages contained in $a_1^*a_2^*\cdots a_k^*$), and decidable and Ackermann-complete for \emph{sweeping} 2-OCNs, where the head direction only changes at the end-markers. Both decidability results revolve around reducing the problem to VASS reachability, but they rely on strikingly different approaches. In a second part, we study the expressive power of 2-OCNs, showing an array of connections between bounded languages, sweeping 2-OCNs, and semilinear languages. Most noteworthy among these connections, is that the bounded languages recognized by sweeping 2-OCNs are precisely those that are semilinear. Finally, we establish an intricate pumping lemma for 2-DOCNs and use it to show that there are OCN languages that are not 2-DOCN recognizable, improving on the known result that there are such 2-OCN languages.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。