|
NOTES 1 General introduction to Theory of Computation
NOTES 2 Methods to show that a language is not regular NOTES 3 (slides) Push-down automata NOTES 4 (slides)
Equivalence of PDA and CGF,
Pumping Lemma for context-free languages. NOTES 5 (slides) Turing machines |
Assignments, announcements, etc.
Assignment 2
Assignment 3
Assignment 4
The midterm exam will be on March 10. You
can bring 2 pages handwritten (on both sides if you want) with whatever
information you want. Guidelines for the exam. Mock Test