Class 1: Intro: course, alphabet, language.

Class 2: Introducing finite automata and JFLAP.

Class 3: Complement, instersect machines with diagrams

Class 4: Set Theory Basics

Class 5: A formal definition of a DFA

Class 6: Functions and Formal Algorithms

Class 7: More formal algorithms

Class 8: More formal algorithms

Class 9: Configurations and a formal def of accept/reject

Class 10: Finishing configurations and started NDFAs

Class 11: Constructing NDFAs & formal definition of NDFAs

Class 12: More algorithms for NDFAs

Class 13: Reprising Proof & Algorithm

Class 14: Converting NDFAs to DFAs

Class 15: Converting NDFAs to DFAs II

PreExam Review

6Wk Exam

Class 16: Intro to Regular Expressions

Class 17: Lab: Regular expressions in Perl

Exam Debrief
&
RE->FA Intro
Homework

Class 18: Equivalence of REs and FAs

Class 19: Pumping Lemma I

Class 20: Pumping Lemma II

Class 21: Pumping Lemma Reprise

Class 22: State Minimization

Class 23: Introduction to Context Free Grammars

Class 24: Parse Trees & Ambiguity

Class 25: Algorithms for CFGs

Class 26: Pushdown Automata

Class 27: Converting Grammars to PDAs

12Wk Exam

Class 28: Parsing Lab

Exam Debrief

Class 29: More on Parsing

Class 30: A Pumping Lemma for CFGs

Class 31: More on what's not a CFL

Class 32: Introduction to Turing Machines

Class 33: A formal definition of a Turing Machine

Class 34: Other Applications of automata & grammars

Class 35: Configurations and completing our formal definition

Class 36: Equivalence of different TMs, Part I

Class 37: Equivalence of different TMs Part II

Class 38: Universal TMs and the Chuch-Turing Thesis

Class 39: The Halting Problem

Class 40: Conclusion