| Week |
Dates |
Topic |
Slides |
PS |
| 01 |
Aug. 23 |
Course Introduction and Administrivia |
|
|
| Aug. 25 |
Regular Languages: Deterministic Finite Automata (DFA) |
|
| 02 |
Aug. 30 |
In-Class Problem Solving Session 01 |
|
|
| Sep. 01 |
Non-Deterministic Finite Automata (NFA) |
|
|
| 03 |
Sep. 06 |
Labor Day Holiday
|
| Sep. 08 |
Closure Properties and Equivalence |
|
|
| 04 |
Sep. 13 |
Regular Expressions |
| |
| Sep. 15 |
Pumping Lemma and Non-Regular Languages |
|
|
| 05 |
Sep. 20 |
Context-Free Languages (CFL): |
|
|
| Sep. 22 |
Context-Free Grammars |
|
|
| 06 |
Sep. 27 |
midterm exam i
|
| Sep. 29 |
Push-Down Automata (PDA), Normal Forms |
|
|
| 07 |
Oct. 04 |
Pumping Lemma for CFL |
|
|
| Oct. 06 |
CFL Properties and Equivalence |
|
|
| 08 |
Oct. 11 |
Recursively-Enumerable Languages (REL): |
|
|
| Oct. 13 |
Recursive vs. REL |
|
|
| 09 |
Oct. 18 |
Turing Machines (TM) |
|
|
| Oct. 20 |
|
|
| 10 |
Oct. 25 |
Halting Problem |
|
|
| Oct. 27 |
midterm exam ii
|
| 11 |
Nov. 01 |
-- buffer space for fallover -- |
|
|
| Nov. 03 |
Computational Complexity: Undecidability |
|
|
| 12 |
Nov. 08 |
Complexity Classes: P, NP, NP-C |
|
|
| Nov. 10 |
P vs. NP |
|
|
| 13 |
Nov. 15 |
Satisfiability, Cook’s Theorem |
|
|
| Nov. 17 |
Church-Turing Thesis |
|
|
| 14 |
Nov. 22 |
thanksgiving break
|
| Nov. 24 |
| 15 |
Nov. 29 |
Topics in Cybersecurity |
|
|
| Dec. 01 |
Topics in Cybersecurity |
|
|
| 16 |
Dec. 06 |
Intrusion Detection using Neural Network Techniques (Dodda) |
|
|
| Machine Translation of Human Language (Bunetic) |
|
|
| Dec. 08 |
Cellular Automata in Image Processing (Alotaibi) |
|
|
| |
|
|
| 17 |
Dec. 12 |
final Exam: 02:00 -- 03:40 p.m.
|
| Dec. 16 |
Link to JFLAP|