|
08/31 |
Sets, Relations and Languages |
Sets, relations, and properties. |
|
09/02 |
Sets, Relations and Languages |
Graph theory. Boolean logic |
|
09/07 |
Sets, relations, and languages |
Definitions. Proof techniques. |
|
09/09 |
Finite Automata |
Alphabets and languages. Deterministic Finite Automata |
|
09/14 |
Finite Automata (HW 1 Due) |
Operations with Languages |
|
09/16 |
No Class |
|
|
09/21 |
Finite Automata (Quiz 1) |
Non-Deterministic Finite Automata |
|
09/23 |
Finite Automata |
Regular Expressions |
|
09/28 |
Finite Automata |
Regular Expressions (cont.) |
|
09/30 |
Finite Automata |
Non-Regular Languages |
|
10/05 |
Finite Automata (HW 2 Due) |
Non-Regular Languages (cont.) |
|
10/07 |
Context-free Languages (Quiz 2) |
Grammars and parse trees. |
|
10/12 |
Context-free Languages |
Grammars and parse trees (cont.) |
|
10/14 |
Context-free Languages (Quiz 3) |
Context Free Grammars (cont.) |
|
10/19 |
Context-free Languages |
Pushdown Automata. |
|
10/21 |
Context-free Languages |
Pushdown Automata (cont.) |
|
10/26 |
Context-free Languages (HW 3 Due) |
Context and non-context free languages. |
|
10/28 |
Context-free Languages (Quiz 4) |
Context and non-context free languages (cont.) |
|
11/02 |
Review for Midterm |
|
|
11/04 |
Midterm 1 |
Sets, relations and languages. Finite Automata. CFL’s |
|
11/09 |
Midterm Review |
|
|
11/11 |
Turing Machines |
Definition and computing with TM’s. Extension of TM’s. |
|
11/16 |
Turing Machines |
Random Access and Nondeterministic TM’s. |
|
11/18 |
Undecidability (Quiz 5) |
Decidable Languages. |
|
11/23 |
Undecidability (HW 4 Due) |
The Halting Problem |
|
11/25 |
No Class – Thanksgiving |
|
|
11/30 |
Midterm Review (Quiz 6) |
|
|
12/02 |
Midterm 2 |
Context Free Languages. Turing machines. |
|
12/07 |
Computational Complexity (HW 5 Due) |
The class P. Boolean Satisfiability. |
|
12/09 |
Computational Complexity (Quiz 7) |
The Class NP. Polynomial-time reductions. |
|
12/14 |
Final Exam |
Comprehensive. |