Abstract
We study the state complexity of the set of subwords and superwords of regular languages, and provide new lower bounds in the case of languages over a two-letter alphabet. We also consider the dual interior sets, for which the nondeterministic state complexity has a doubly-exponential upper bound. We prove a matching doubly-exponential lower bound for downward interiors in the case of an unbounded alphabet. © 2014 Springer International Publishing.
Cite
CITATION STYLE
Karandikar, P., & Schnoebelen, P. (2014). On the state complexity of closures and interiors of regular languages with subwords. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8614 LNCS, pp. 234–245). Springer Verlag. https://doi.org/10.1007/978-3-319-09704-6_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
