Descriptional Complexity of Winning Sets of Regular Languages.

Pierre Marcus Ilkka Törmä

Published in: CoRR (2020)

Keyphrases

regular languages
decision problems
context free languages
regular expressions
grammatical inference
pac learning
positive data
computational complexity
worst case
context free grammars
finite automata
finite state machines
context free