| Week | Date | Topic/Read Before Class | Assignment |
| 1 | M, 08/30 | Course information, go over the syllabus,
Section 1.1 Set Theory |
|
| W, 09/01 | Section 1.1 Set Theory (cont'd) Section 1.2 Cartesian Product, Relations |
Homework 1 (pdf) | |
| F, 09/03 | Section 1.2 Cartesian Product, Relations (cont'd) Section 1.3 Equivalence Relations |
||
| 2 | M, 09/06 | no class -- Labor Day recess | |
| W, 09/08 | Review homework 1 Section 1.3 Equivalence Relations(cont'd) Section 1.2 Functions |
Homework 2 (pdf) | |
| F, 09/10 | no class -- K-day recess | ||
| 3 | M, 09/13 | Section 1.2 Functions(cont'd) Section 1.4 Countable and uncountable sets |
|
| W, 09/15 | Review homework 2 Section 1.6 Recursive definitions |
Homework 3 (pdf) | |
| F, 09/17 | no class -- workshop | ||
| 4 | M, 09/20 | Section 1.7 Mathematical Induction | |
| W, 09/22 |
Chapter 2 Languages Section 2.1 Strings and Languages Section 2.2 Finite Specification of Languages |
Homework 4 (pdf) | F, 09/24 | Review homework 3 Section 2.2 Finite Specification of Languages(cont'd) |
| 5 | M, 09/27 | no class -- NSF HSD Grantees Conference | |
| W, 09/29 | Review homework 4 Review exam 1 topics |
Homework 5 (pdf) | |
| R, 09/30 | Midterm exam 1 at 6:00pm Building: 07 - Electrical Energy Resources Room: 0103 Sections covered: 1.1, 1.2, 1.3, 1.4, 1.6, 1.7, 2.1, 2.2 Sections NOT covered: 1.5, 1.8 |
||
| F, 10/01 | Section 2.3 Regular Sets and Expressions (cont'd) | ||
| 6 | M, 10/04 | (Note: the MTU Career Fair is tomorrow, on Tuesday.) Regular expression examples Chapter 3 Context-Free Grammars Section 3.1 Context-Free Grammars and Languages Section 3.2 Examples of Grammars and Languages |
|
| W, 10/06 | Review homework 5 Section 3.2 Examples of Grammars and Languages (cont'd) |
Homework 6 (pdf) | |
| F, 10/08 | Section 3.2 Examples of Grammars and Languages (cont'd) Section 3.4 Verifying Grammars |
||
| 7 | M, 10/11 | Review exam 1
(grades) Section 3.5 Leftmost derivations and ambiguity |
|
| W, 10/13 | Review homework 6 Chapter 4 Normal Forms for Context-Free Grammars Section 4.1 Grammar transformations Section 4.2 Elimination of λ-rules (handout) |
Homework 7 (pdf) | |
| F, 10/15 |
Section 4.2 Elimination of λ-rules (cont'd) Section 4.3 Elimination of chain rules (handout) |
||
| 8 | M, 10/18 | Section 4.4 Useless symbols (handout 1) (handout 2) |
|
| W, 10/20 | Review homework 7 Review exam 2 topics Section 4.5 Chomsky Normal Form |
Homework 8 (pdf) | |
| R, 10/21 | Midterm exam 2 at 6:00pm Building: 15 - Fisher Hall Room: 0139 Sections covered: 2.2, 2.3, 3.1, 3.2, 3.4, 3.5, 4.1, 4.2, 4.3, 4.4 Sections NOT covered: 2.4, 3.3. The next exams covers: 4.5 and onwards. |
||
| F, 10/22 |
Section 4.5 Chomsky Normal Form (cont'd) Section 4.6 The CYK algorithm (handout in pdf) |
||
| 9 | M, 10/25 | Section 4.6 The CYK algorithm (cont'd) Section 4.7 Removal of Direct Left Recursion |
Halloween bonus homework (pdf) |
| W, 10/27 | Review homework 8 Section 4.6 The CYK algorithm (pseudocode) Section 4.7 Removal of Direct Left Recursion Section 18.1 The Graph of a Grammar (Section 18.2 A Top-Down Parser) (Only the definition of a parser and a terminal prefix was mentioned from Section 18.2) |
Homework 9 (pdf) | |
| F, 10/29 | Section 19.1 Lookahead in Context-Free Grammars | ||
| 10 | M, 11/01 |
Section 19.2 FIRST, FOLLOW, and Lookahead Sets Algorithm 19.4.1 Construction of FIRSTk sets (handout) (parser algorithm) |
|
| W, 11/03 | Section 5.1 A Finite-State Machine Section 5.2 Deterministic Finite Automata Section 5.3 State Diagrams and Examples |
||
| F, 11/05 | Review homework 9 Continue with Deterministic Finite Automata Maillardet's automata |
Homework 10 (pdf) | |
| 11 | M, 11/08 |
Section 5.4 Nondeterministic Finite Automata Section 5.5 λ-transitions |
|
| W, 11/10 | Section 6.1 Finite-state Acceptance of Regular Languages | F, 11/12 | Review homework 10 Converting NFAs into DFAs |
Homework 11 (pdf) |
| 12 | M, 11/15 | Review for exam 3 Converting NFAs into DFAs (cont'd) |
|
| T, 11/16 | Midterm exam 3 at 6:00pm Building: 07 - Electrical Energy Resources Room: 0103 Sections covered: 4.5, 4.6, 4.7, 18.1, 18.2, 19.1, 19.2, 19.3, 19.4, 5.1, 5.2, 5.3, 5.4, 5.5, 6.1. Sections NOT covered: 4.8, 5.6, 5.7, 6.2 -- 6.7, 18.3 -- 18.5, 19.5 -- 19.8 |
||
| W, 11/17 |
Converting NFAs into DFAs (cont'd) Section 7.1 Pushdown Automata Deterministic PDAs |
||
| F, 11/19 | Review homework 11, part 1 Section 7.1 Pushdown Automata (cont'd) |
||
| -- | M, 11/22 | no class -- Thanksgiving recess | |
| W, 11/24 | no class -- Thanksgiving recess | ||
| F, 11/26 | no class -- Thanksgiving recess | ||
| 13 | M, 11/29 |
Section 7.1 Pushdown Automata (cont'd)
Nondeterministic PDAs |
|
| W, 12/01 | Review exam 3
(grades) Section 8.1 The Standard Turing Machine |
||
| F, 12/03 |
Section 8.1 The Standard Turing Machine (cont'd) Section 8.2 Turing machines as Language acceptors |
Homework 12 (pdf) | |
| 14 | M, 12/06 | no class -- Winter Simulation Conference (www.wintersim.org) | |
| W, 12/08 | Section 8.2 Turing machines as Language acceptors (cont'd) | ||
| F, 12/10 | Section 8.2 Turing machines as Language acceptors (cont'd) Review for the final exam (homework grades) |
||
| Finals | M, 12/13 |
Final Exam on Monday (12/13) Time: 3:00pm-5:00pm Place: ME-EM 112 Sections covered: Finite automata: 5.1, 5.2, 5.3, 5.4, 5.5, 5.6 Pushdown automata: 7.1 Turing machines: 8.1, 8.2 Sections NOT covered: 5.7, 7.2 -- 7.5,8.3 -- 8.8 |
Good luck! |
Note: A week-long homework is assigned almost every Wednesday.