Handbook of formal languages, vol. 1
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Theory of Codes
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Computing forbidden words of regular languages
Fundamenta Informaticae - Special issue on computing patterns in strings
Open Constraints in a Boundable World
CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Descriptional and computational complexity of finite automata---A survey
Information and Computation
Decision problems for convex languages
Information and Computation
Quotient complexity of ideal languages
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Quotient complexity of closed languages
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Complexity in convex languages
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
| Hi-index | 0.00 |
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.