| January 2006 | ||||||
| Sunday | Monday | Tuesday | Wednesday | Thursday | Friday | Saturday |
| 1 | 2 | 3 | 4 | 5 | 6 | 7 |
| 8 | 9 Class 1: Intro: course, alphabet, language. |
10 | 11 Class 2: Introducing finite automata and JFLAP. |
12 Lab 1: Build your own DFA |
13 | 14 |
| 15 | 16 MLK Day |
17 | 18 Class 3: Complement, instersect machines with diagrams |
19 Lab 2: Build your own NDFA |
20 Add Deadline |
21 |
| 22 | 23 Class 4: Set Theory Basics Prereg Begins |
24 | 25 Class 5: A formal definition of a DFA |
26 Lab 3: Securing your Turing machine |
27 | 28 |
| 29 | 30 Class 6: Functions and Formal Algorithms (Quiz 1 Due 9/6) |
31 | ||||
| February 2006 | ||||||
| Sunday | Monday | Tuesday | Wednesday | Thursday | Friday | Saturday |
| 1 Class 7: More formal algorithms |
2 Class 8: More formal algorithms Monday Schedule |
3 | 4 | |||
| 5 | 6 Exam |
7 | 8 Class 9: Configurations and a formal def of accept/reject |
9 Lab 4: Networked Turing Machines |
10 | 11 |
| 12 | 13 Class 10: Finishing configurations and started NDFAs |
14 | 15 Class 11: Constructing NDFAs & formal definition of NDFAs |
16 Lab 5: Microsoft .TM Technology |
17 | 18 |
| 19 | 20 Presidents Day |
21 | 22 Class 12: More algorithms for NDFAs (Quiz 2 Due 9/19) |
23 | 24 | 25 |
| 26 | 27 | 28 | ||||