| August 28 | Course overview | --- | ||
| August 30 | Math review | Section 1.1 | ||
| September 4
. |
Math review
Basic concepts |
Section 1.2 |
||
| September 6
. |
Basic concepts
DFAs |
Section 2.1 |
||
| September 13
. |
DFAs
NFAs |
Section 2.2 |
||
| September 18 | DFAs = NFAs | Section 2.3 | ||
| September 20
. . |
DFAs = NFSa
Regular expressions Expressions = NFAs |
Section 3.1 Section 3.2 |
||
| September 25 | Expressions = NFAs | |||
| September 27 | EXAM #1 | --- | ||
| October 2 | Regular grammars | Section 3.3 | ||
| October 4 | Regular grammars | |||
| October 9
. |
Closure properties
Elementary questions |
Section 4.1
Section 4.2 |
||
| October 11
. |
Elementary questions
Pumping lemma |
Section 4.3 |
||
| October 16
. |
Pumping lemma
Context-free grammars |
Section 5.1 |
||
| October 18
. |
Context-free grammars
Parsing |
Sections 5.2 and 5.3 |
||
| October 23 | Parsing | |||
| October 25
. |
Parsing
Simplification |
Section 6.1 |
||
| October 30 | Simplification | |||
| November 1 | EXAM #2 | --- | ||
| November 6
. |
Simplification
Normal forms |
Section 6.2 |
||
| November 8
. |
Normal forms
Pushdown automata |
Sections 7.1 and 7.3 |
||
| November 13 | Pushdown automata | |||
| November 15 | Pushdown automata | |||
| November 20
. |
Pushdown automata
Turing machines |
Sections 9.1 and 9.3 |
||
| November 27 | Turing machines | |||
| November 29 | Turing machines | |||
| December 4 | Exam Review | --- | ||
| December 6 | FINAL EXAM | --- |