Some files will be in PDF format. To view them you may need to download Adobe Acrobat's free reader. This schedule is highly speculative and subject to change. It will be updated throughout the course.
| Date | Topic | Reading | Wk | Notes | ||
| M,W | Jan | 7,9 |
Introduction and Motivation Intro to Proofs |
Chap 1-1.4 | 1 | Chapter 1: pdf |
| M,W | Jan | 14,16 | Automata Theory Concepts, DFA's | Chap 1.5-1.7, 2.1-2.2 | 2 | Chapter 2: pdf |
| M,W | Jan | 21,23 |
Holiday Monday, Jan 21: Alaska Civil Rights Day NFA's |
Chap 2.3-2.5 | 3 | Epsilon Transitions:pdf |
| M,W | Jan | 28,30 |
Regular Expressions
|
Chap 3 | 4 | Chapter 3, RegEx: pdf |
| M,W | Feb | 4,6 | Properties of Regular Languages | Chap 4 | 5 |
Chap 3, Unix RegEx: pdf Algebra, Pumping Lemma:pdf |
| M,W | Feb | 11,13 |
Review Midterm #1, 2/13 |
6 | ||
| M,W | Feb | 18,20 | Context-Free Grammars | Chap 5.1-5.3 | 7 | Closure, Decisions: pdf |
| M,W | Feb/Mar | 25,27 |
Context-Free Grammars Pushdown Automata |
Chap 5.4-5.6, 6.1-6.2 | 8 | CFG: pdf |
| M,W | Mar | 4,5 |
PDA's Normal Forms for CFG's |
Chap 6.3-6.6, 7.1 | 9 |
CFG Apps: pdf,
ppt.
PDA: pdf. |
| M,W | Mar | 11,13 | Pumping Lemma, Decision Properties of CFG's | Chap 7.2-7.6 | 10 | CNF: pdf |
| M,W | Mar | 18,20 |
Midterm #2, 3/18 Turing Machines |
Chap 8.1-8.2 | 11 | . |
| M,W | Mar | 25,27 | Spring Break | 12 | . | |
| M,W | Apr | 1,3 |
Turing Machine Variations
|
Chap 8.3-8.8 | 13 |
CFL Properties: pdf Turing Machine Intro: pdf |
| M,W | Apr | 8,10 |
Undecidability
|
Chap 9 | 14 | TM, Decidability: pdf |
| M,W | Apr | 15,17 |
Completeness |
Chap 10 | 15 |
P/NP: pdf
CSAT : pdf |
| M,W | Apr | 22,24 | Contingency Days | . | ||
| May | 1 | Final Exam, Wednesday, 10:00-12:45 PM | . | Finals Week | Time Wednesday, 10:00-12:45 PM | |