Schedules

This is a tentative schedule and only serves as a guide line.

Week 1 (08/27 and 08/29):

Introduction

Week 2 (09/01, 09/03, and 09/05):

Deterministic finite automata (DFAs)

Week 3 (09/08, 09/10, and 09/12):

Nondeterministic finite automata (NFAs)

Week 4 (09/15, 09/17, and 09/19):

Regular expressions (REs)

Week 5 (09/22, 09/24, and 09/26):

Non-regular languages (Non-RLs)

Week 6 (09/29, 10/01, 10/03):

Context-free grammars and context-free languages (CFGs and CFLs)

Week 7 (10/06, 10/08, and 10/10):

Pushdown automata (PDAs) and midterm exam on 10/10

Week 8 (10/15, 10/17):

Non-CFLs

Week 9 (10/20, 10/22, and 10/24):

Turing machines

Week 10 (10/27, 10/29, and 10/31):

Decidability

Week 11 (11/03, 11/05, and 11/07):

Reducibility and undecidability

Week 12 (11/10, 11/12, and 11/14):

Complexity classes

Week 13 (11/17, 11/19, 11/21):

NP-completeness

Week 14 (11/24):

NP-completeness

Week 15 (12/01, 12/03, and 12/05):

NP-completeness