Descriptional Complexity of Winning Sets of Regular Languages.

Pierre Marcus Ilkka Törmä

Published in: DCFS (2020)

Keyphrases

regular languages
decision problems
grammatical inference
regular expressions
context free languages
finite automata
worst case
positive data
computational complexity
logic programs
context free grammars