Winning Sets of Regular Languages: Descriptional and Computational Complexity.

Pierre Marcus Ilkka Törmä

Published in: CoRR (2021)

Keyphrases

regular languages
computational complexity
decision problems
context free languages
finite automata
grammatical inference
regular expressions
positive data
special case
pac learning
context free grammars
database systems
np hard
upper bound