CS 311
Fall 2008
Audrey St. John
Schedule
Syllabus
Notes
Assignments
Notes
As the semester progresses, I will post notes used for lectures. These are not complete and certainly are no substitute for the lecture; they are more of an overview and reminder of what will be covered in class.
Notes 1: Overview, Intro to DFAs
Notes 2: Regular operations
Notes 3: NFAs
Notes 4: Equivalence of NFAs and DFAs
Notes 5: Closure under regular operations
Notes 6: Regular expressions
Notes 7: Regular expressions <=> Regular languages
Notes 8: Nonregular languages
Notes 9: Context-free grammars
Notes 10: Context-free grammars and pushdown automata
Notes 11: CFGs => PDAs
Notes 12: PDAs => CFGs
Notes 13: Turing Machines
Notes 14: More Turing Machines
Notes 15: Algorithms
Notes 16: Decidable languages
Notes 17: The Halting Problem
Notes 18: Reducibility
Notes 19: Mapping reducibility
Notes 20: Measuring time complexity
Notes 21: P and NP
Notes 22: NP-completeness
Notes 23: More NP-completeness