Lecture Notes

00 Introduction, Review, Languages.pdf

01 DFAs and Regular Languages.pdf

02 NFAs and Regular Language Closures.pdf

03 Regular Expressions.pdf

04 Non-Regular Languages.pdf

04.5 The Pumping Lemma Revisited.pdf

05 Context-Free Languages.pdf

06 Context-Free Languages, Continued.pdf

07 Non-Context-Free Languages.pdf

08 Midterm Review.pdf

09 Turing Machines.pdf

10 Turing Machine Variants.pdf

11 Encodings of Other Objects.pdf

12 Undecidable Languages.pdf

14 Rice’s Theorem, Time Complexity.pdf

15 Time Complexity Classes.pdf

16 NP-Hard and NP-Complete Problems.pdf