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

Prateek Karandikar, Matthias Niewerth, Philippe Schnoebelen

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 interio…