A Proof of the Pumping Lemma for Context-Free Languages Through Pushdown Automata
Antoine AmarilliMarc JeanmouginPublished in: CoRR (2012)
Keyphrases
- context free languages
- regular languages
- context free
- grammatical inference
- finite automata
- regular expressions
- context free grammars
- finite state
- context dependent
- context sensitive
- positive data
- decision problems
- pac learning
- inductive inference
- finite state machines
- pattern matching
- model checking
- training data
- dynamic programming