Pumping Lemma for Context-Free Languages Flashcards
1
Q
What is the Pumping Lemma for Context-Free Languages?
A
2
Q
How to use the Pumping-Lemma (as a game)?
Context Free
A
Automata & Complexity (24 decks)
- Introduction
- Words & Languages
- Finite Automata
- (Regular) Grammars
- Regular Expressions
- Regular Languages
- Word Matching
- Automata Minimization
- Pumping Lemma
- Context-Free Languages
- Chomsky Normal Form
- CYK Parsing
- LL Parsing
- Pushdown Automata
- Pumping Lemma for Context-Free Languages
- Properties of Context-Free Languages
- Turing Machines
- Recursively Enumerable Languages
- Unrestricted Grammars
- Context-Sensitive Grammars & Linear Bounded Automata
- Chomsky Hierarchy
- Undeciability
- Complexity
- Exam Questions
