The Pumping Lemma for Regular Languages is Hard.

Hermann Gruber Markus Holzer Christian Rauch

Published in: CIAA (2023)

Keyphrases

regular languages
context free languages
regular expressions
grammatical inference
finite automata
decision problems
context free grammars
pac learning
positive data
finite state machines
inductive inference
statistical queries
dynamic programming
boolean functions
model checking
pattern matching
data management