Decision problems for convex languages

作者：Brzozowski Janusz^*; Shallit Jeffrey; Xu Zhi

来源：Information and Computation, 2011, 209(3): 353-367.

DOI：10.1016/j.ic.2010.11.009

• Finite automaton
• Complexity
• Convex language
• Regular language
• Prefix-free
• Suffix-free
• Ideal

We examine decision problems for various classes of convex languages, previously studied by Ang and Brzozowski, originally under the name "continuous languages". We can decide whether a language L is prefix-, suffix-, factor-, or subword-convex in polynomial time if L is represented by a DFA, but these problems become PSPACE-complete if L is represented by an NFA. If a regular language is not convex, we find 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. Finally, we briefly examine these questions where L is represented by a context-free grammar.

• 出版日期2011-3