WEEK |
TOPIC |
READING |
1 |
Introduction |
Chapter 1 |
* |
Labor Day (no classes held) |
* |
2 |
Finite Automata |
Chapter 2 |
3 |
Finite Automata |
Chapter 2 |
4 |
Regular Expressions and
Languages |
Chapter 3 |
5 |
Regular Expressions and
Languages |
Chapter 3 |
6 |
Properties of Regular Languages |
Chapter 4 |
7 |
Mid-term Examination (10/16 5:30-7:30 PM) |
- |
8 |
Context-Free Grammars and
Languages |
Chapter 5 |
9 |
Context-Free Grammars and
Languages |
Chapter 5 |
10 |
Pushdown Automata |
Chapter 6 |
11 |
Properties of Context-Free
Languages |
Chapter 7 |
* |
Fall Break (no classes held) |
* |
12 |
Introduction to Turing Machines |
Chapter 8 |
13 |
Undecidability |
Chapter 9 |
14 |
Beyond Computation |
Supplementary materials |
15 |
Final Examination (12/18 5:30-7:30 PM) |
- |