Sciweavers

Share
TCS
2016

On the state complexity of closures and interiors of regular languages with subwords and superwords

3 years 13 days ago
On the state complexity of closures and interiors of regular languages with subwords and superwords
The downward and upward closures of a regular language L are obtained by collecting all the subwords and superwords of its elements, respectively. The downward and upward interiors of L are obtained dually by collecting words having all their subwords and superwords in L, respectively. We provide lower and upper bounds on the size of the smallest automata recognizing these closures and interiors. We also consider the computational complexity of decision problems for closures of regular languages.
Prateek Karandikar, Matthias Niewerth, Philippe Sc
Added 10 Apr 2016
Updated 10 Apr 2016
Type Journal
Year 2016
Where TCS
Authors Prateek Karandikar, Matthias Niewerth, Philippe Schnoebelen
Comments (0)
books