Computer Science 423/523
Finite Automata
Fall 2012

Weizhen Mao
Department of Computer Science
College of William and Mary


General Information | Schedules | Announcements | Lectures | Assignments | Exams

Schedules

Week 1 (08/29 and 08/31):
Introduction
Week 2 (09/03, 09/05, and 09/07):
Deterministic finite automata (DFAs)
Week 3 (09/10, 09/12, and 09/14):
Nondeterministic finite automata (NFAs)
Week 4 (09/17, 09/19, and 09/21):
Regular expressions (REs)
Week 5 (09/24, 09/26, and 09/28):
Non-regular languages (Non-RLs)
Week 6 (10/01 only):
Context-free grammars and context-free languages (CFGs and CFLs)
Week 7 (10/08, 10/10, and 10/12):
Pushdown automata (PDAs) and midterm exam on 10/10
Week 8 (10/17, 10/19):
Non-CFLs
Week 9 (10/22, 10/24, and 10/26):
Turing machines
Week 10 (10/29, 10/31, and 11/02):
Decidability
Week 11 (11/05, 11/07, and 11/09):
Reducibility and undecidability
Week 12 (11/12, 11/14, and 11/16):
Complexity classes
Week 13 (11/19):
NP-completeness
Week 14 (11/26, 11/28, and 11/30):
NP-completeness
Week 15 (12/03, 12/05, and 12/07):
NP-completeness

Last modified: August 1, 2012