A Note on the Pumping Lemma for Regular Languages.

Published in: Inf. Process. Lett. (1979)

Keyphrases

regular languages
context free languages
grammatical inference
regular expressions
finite automata
decision problems
context free grammars
pac learning
positive data
finite state machines
utility function
pattern matching
statistical queries
database
context free
upper bound
dynamic programming
machine learning