Course Syllabus (doc)

Course Schedule (doc)(Updated! Mar. 20)

• Math Preliminaries: Sets, Relations, Functions, Infinities (ppt)
• Introduction to Chomsky Hierarchy (Word)
• Supplementary Notes on Chomsky Hierarchy (PPT)
• Introduction to Finite State Automata
• DFAs as Code and NFAs as Mathematical Relations
• The State Minimization of DFAs
• Equivalence of NFAs to Right-linear Grammars + Closure Properties of Regular Languages
• Regular Expressions
• Applications of Regular Expressions to Structured Programming (PowerPoint)
• Pumping Lemma for Regular Languages & Myhill-Nerode Theorem (Word)(Updated! Oct. 12)
• Context-free Languages and Pushdown Automata (Word)
• Top-down Parsing with LL(k) Grammars( Mar 18)
• Bottom-up Parsing with Weak Precedence Grammars ( Mar 23)
• Summary of Parsing Theory and Programming Languages (ppt)(New! Mar 25)
• Introduction to PDAs (ppt)
• Turing Machines (Word)
• Turing Machines (PowerPoint)