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

Prateek Karandikar Philippe Schnoebelen

Published in: CoRR (2014)

Keyphrases

regular languages
grammatical inference
decision problems
regular expressions
state space
context free languages
computational complexity
finite state machines
worst case
model selection
learning theory
pac learning