arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1409.3943cs.FL
收藏

交替塔和分段可测试分离器

Alternating Towers and Piecewise Testable Separators

Štěpán Holub, Tomáš Masopust, Michaël Thomazo

摘要:

两种语言可被分段可测语言分离当且仅当它们之间不存在无限塔。一个无限塔是一个在两种语言之间交替的字符串的无限序列,每个字符串都是后面所有字符串的子序列(分散的子串)。对于用非确定有限自动机表示的正则语言,无限塔的存在性在多项式时间内是可判定的。在本文中,我们研究了一个特定的方法来计算一个分段可测试的分离器的复杂性。我们表明,它是密切相关的最大有限塔的高度,并提供了上界和下界的大小给定的不确定自动机。具体来说,我们表明,上界是多项式与基数的字母表的指数状态的数量。关于下界,我们表明,塔的指数高度相对于基数的字母表存在。由于这些塔大多是前缀序列,我们也提供了一个比较与塔的前缀。

英文摘要:

Two languages are separable by a piecewise testable language if and only if there exists no infinite tower between them. An infinite tower is an infinite sequence of strings alternating between the two languages such that every string is a subsequence (scattered substring) of all the strings that follow. For regular languages represented by nondeterministic finite automata, the existence of an infinite tower is decidable in polynomial time. In this paper, we investigate the complexity of a particular method to compute a piecewise testable separator. We show that it is closely related to the height of maximal finite towers, and provide the upper and lower bounds with respect to the size of the given nondeterministic automata. Specifically, we show that the upper bound is polynomial with respect to the number of states with the cardinality of the alphabet in the exponent. Concerning the lower bound, we show that towers of exponential height with respect to the cardinality of the alphabet exist. Since these towers mostly turn out to be sequences of prefixes, we also provide a comparison with towers of prefixes.

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

↑