Login / Signup
On the state complexity of closures and interiors of regular languages with subwords and superwords.
Prateek Karandikar
Matthias Niewerth
Philippe Schnoebelen
Published in:
Theor. Comput. Sci. (2016)
Keyphrases
</>
regular languages
regular expressions
finite automata
databases
computational complexity
state space
worst case
grammatical inference
data model
special case
decision problems
positive and negative
context free languages