分段可测语言的可分性是PTime完全的
Separability by Piecewise Testable Languages is PTime-Complete
摘要:
分段可测试语言构成了Straubing-Thérien层次结构的第一层。这个级别的成员问题是可判定的,如果DFA的语言是分段可测试的,则测试是NL完全的。这一问题尚未在国家粮食机构中得到解决。我们通过证明它是PSpace完备的来填补这个空白。主要的结果是,然后的下限复杂性的分离的正则语言的分段可测试的语言。两个正则语言可被一个分段可测试语言分离,如果该分段可测试语言包含其中一个正则语言,并且与另一个正则语言不相交。对于NFA表示的语言,分段可测试语言的可分性在PTime中是可判定的。我们表明,它是PTime硬,它仍然是PTime硬,即使是最小的DFA。
英文摘要:
Piecewise testable languages form the first level of the Straubing-Thérien hierarchy. The membership problem for this level is decidable and testing if the language of a DFA is piecewise testable is NL-complete. The question has not yet been addressed for NFAs. We fill in this gap by showing that it is PSpace-complete. The main result is then the lower-bound complexity of separability of regular languages by piecewise testable languages. Two regular languages are separable by a piecewise testable language if the piecewise testable language includes one of them and is disjoint from the other. For languages represented by NFAs, separability by piecewise testable languages is known to be decidable in PTime. We show that it is PTime-hard and that it remains PTime-hard even for minimal DFAs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。