Lecture and Seminary on Thursday, April 19, 2018
Section outline
-
Topics: - Pumping Lemma for context-free languages
- Applications
- Context-free languages over a single-letter alphabet
- Pushdown Automata (PDA)
- Acceptance by empty pushdown and by final state
- Each context-free language is accepted by a PDA
-
Slides for Lecture 9
-
The solutions to these problems are to be presented and discussed in the Seminary on April 26, 2018.
-
This file contains solutions to selected problems from Assignment 9.
-