arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0808.1928cs.CCcs.DMcs.FL
收藏

凸语言的判定问题

Decision Problems For Convex Languages

Janusz Brzozowski, Jeffrey Shallit, Zhi Xu

摘要:

在本文中,我们将研究与各类凸语言相关的决策问题,由Ang和Brzozowski(以“连续语言”的名义)进行研究。我们表明,我们可以决定是否一个给定的语言L是前缀,后缀,因子,或子词凸在多项式时间,如果L是由DFA表示,但问题是PSPACE-硬,如果L是由NFA表示。在这种情况下,一个正则语言是不凸的,我们证明紧上限的最短的话证明这一事实的长度,在接受DFA的状态数。类似的结果证明了凸语言的一些子类:前缀,后缀,因子,和子词封闭的语言,和前缀,后缀,因子,和子词自由的语言。

英文摘要:

In this paper we examine decision problems associated with various classes of convex languages, studied by Ang and Brzozowski (under the name "continuous languages"). We show that we can decide whether a given language L is prefix-, suffix-, factor-, or subword-convex in polynomial time if L is represented by a DFA, but that the problem is PSPACE-hard if L is represented by an NFA. In the case that a regular language is not convex, we prove tight upper bounds on the length of the shortest words demonstrating this fact, in terms of the number of states of an accepting DFA. Similar results are proved for some subclasses of convex languages: the prefix-, suffix-, factor-, and subword-closed languages, and the prefix-, suffix-, factor-, and subword-free languages.

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

↑