Advertisement
Published in:
2009 | OriginalPaper | Chapter
Decision Problems for Convex Languages
Authors : Janusz Brzozowski, Jeffrey Shallit, Zhi Xu
Published in: Language and Automata Theory and Applications
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We examine decision problems for various classes of convex languages, previously studied by Ang and Brzozowski 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 the problem is PSPACE-hard if
L
is represented by an NFA. If 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.