Formal Languages and Computability (INF3, Autumn'05)
Lecture 7
Main topic:
Languages that are not context-free
Lecture Plan
pushdown automata
pumping lemma for context-free languages
Reading
Section 2.2 and 2.3 (p. 111-117; 125-129)