Winning Sets of Regular Languages: Descriptional and Computational Complexity.

Pierre Marcus Ilkka Törmä

Published in: J. Autom. Lang. Comb. (2023)

Keyphrases

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