Computer Science 423/523
Finite Automata
Fall 2005
Weizhen Mao
Department of Computer Science
College of William and Mary
General Information |
Schedules |
Announcements |
Lectures |
Assignments |
Exams
Schedules
Week 1 (08/24 and 08/26):
- Introduction
Week 2 (08/29, 08/31, and 09/02):
- Deterministic finite automata (DFAs)
Week 3 (09/05, 09/07, and 09/09):
- Nondeterministic finite automata (NFAs)
Week 4 (09/12, 09/14, and 09/16):
- Regular expressions (REs)
Week 5 (09/19, 09/21, and 09/23):
- Non-regular languages (Non-RLs)
Week 6 (09/26, 09/28 and 09/30):
- Context-free grammars and context-free languages (CFGs and CFLs)
Week 7 (10/03, 10/05, and 10/07):
- Pushdown automata (PDAs) and midterm exam on 10/07
Week 8 (10/12, and 10/14):
- Discussion of the midterm exam and catching-up
Week 9 (10/17, 10/19, and 10/21):
- Non-CFLs
Week 10 (10/24, 10/26, and 10/28):
- Turing machines (TMs)
Week 11 (10/31, 11/02, and 11/04):
- Decidability
Week 12 (11/07, 11/09, and 11/11):
- Reducibility and undecidability
Week 13 (11/14, 11/16, and 11/18):
- Complexity classes
Week 14 (11/21):
- NP-completeness
Week 15 (11/28, 11/30, and 12/02):
- Catching-up
Last modified: September 14, 2005