A lower bound on the oscillation complexity of context-free languages.

Thomas Gundermann

Published in: FCT (1985)

Keyphrases

matching algorithm
lower bound
context free languages
worst case
upper bound
grammatical inference
context free grammars
computational complexity
optimal solution
np hard
objective function
sample complexity
vc dimension
regular languages
training data
machine learning
context free