Handouts:
Labs:
Javadoc for Finite Automata Package
| Lab 1 documents |
| Lab 2 documents |
| Lab 3 documents |
| Lab 4 documents |
| Lab 5 documents |
| Lab 6 documents |
| Lab 7 documents |
| Lab 8 (extra credit) |
Homework Assignments:
Number |
Due Date | Assignment |
1
|
W 9/14 |
Chap 0 #1-11 |
2 |
W 9/21 |
Chap 1 #1, 2, 3, 5, 6 |
3 |
W 9/28 |
Chap 1 #7, 8, 9, 10ab, 12, 14, 16, 18 |
4 |
W 10/5 |
Chap 1 #22, 28ab, 29ab, 31, 36, 46abc, 49 |
4 |
W 10/5 |
Extra Credit: Chap 1 #46d |
5 |
F 10/14 |
Chap 2 #1, 3, 4, 6ab, 9, 14, 16 |
6 |
F 10/28 |
Chap 2 #2, 5, 7ab, 10, 11, 12, 13, 18, 30ad, 31 |
7 |
F 11/4 |
Chap 3 #1ac, 2bd, 5, 6, 7, 8bc, 15 |
8 |
M 11/21 |
Chap 4 #1-12 |
9 |
R 12/8 |
Chap 5 #1-7, 17, 19, 20, 22 Chap 7 #1, 2, 5 (prove your answer), 8-11 |
Tentative Schedule:
| week of | day | assignment | topic |
| SEP 5 | Mon | Introduction | |
| (week 1) | Wed | Lab 1: Alphabet 1 | |
| Thu | 0.1, 0.2 | Mathematical Terminology | |
| Fri | 0.3, 0.4 | Definitions, Theorems, Proofs | |
| SEP 12 | Mon | 1.1 | Finite Automata |
| (week 2) | Wed | Lab 2: Alphabet 2 | |
| Thu | 1.1 | Finite Automata | |
| Fri | 1.2 | Nondeterminism | |
| SEP 19 | Mon | 1.2 | Nondeterminism |
| (week 3) | Wed | Lab 3: DFA 1 | |
| Thu | 1.3 | Regular Expressions | |
| Fri | 1.3 | Regular Expressions | |
| SEP 26 | Mon | 1.4 | Nonregular Languages |
| (week 4) | Wed | Lab 3b: DFA 1 cont. | |
| Thu | 1.4 | Nonregular Languages | |
| Fri | 1.4 | Nonregular Languages | |
| OCT 3 | Mon | 2.1 | Context-free Grammars |
| (week 5) | Wed | Lab 4: DFA 2 | |
| Thu | Review | ||
| Fri | Exam 1, through Chapter 1 | ||
| OCT 10 | Mon | 2.1 | Context-free Grammars |
| (week 6) | Wed | Lab 5: DFA 3 | |
| Thu | 2.2 | Pushdown Automata | |
| Fri | 2.2 | Pushdown Automata | |
| OCT 17 | Mon | *** Fall Break *** | |
| (week 7) | Wed | Lab 6: NFA 1 | |
| Thu | 2.3 | Non-context-free Languages | |
| Fri | 2.3 | Non-context-free Languages | |
| Oct 24 | Mon | 3.1 | Turing Machines |
| (week 8) | Wed | Lab 7: tba | |
| Thu | 3.2 | Variants of Turing Machines | |
| Fri | 3.3 | The Definition of Algorithm | |
| OCT 31 | Mon | 3.3 | The Definition of Algorithm |
| (week 9) | Wed | Lab 8: tba | |
| Thu | 4.1 | Decidable Languages | |
| Fri | review | ||
| NOV 7 | Mon | Exam 2, Chapters 2 & 3 | |
| (week 10) | Wed | Lab 9: tba | |
| Thu | 4.2 | The Halting Problem | |
| Fri | 4.2 | The Halting Problem | |
| NOV 14 | Mon | 5.1 | Undecidable Problems from Language Theory |
| (week 11) | Wed | Lab 10: tba | |
| Thu | 5.2 | A Simple Undecidable Problem | |
| Fri | 5.3 | Mapping Reducibility | |
| NOV 21 | Mon | 5.3 | Mapping Reducibility |
| (week 12) | *** Thanksgiving Break Nov. 23-25 *** | ||
| NOV 28 | Mon | 7.1 | Measuring Complexity |
| (week 13) | Wed | 7.1 | Measuring Complexity |
| Thu | 7.2 | The Class P | |
| Fri | 7.3 | The Class NP | |
| DEC 5 | Mon | 7.3 | The Class NP |
| (week 14) | Wed | 7.4 | NP-completeness |
| Thu | catch-up day | ||
| Fri | review | ||
| EXAM WEEK | Wed | 2 PM | Exam 3 |