| Chapter 2.1 - DFAs |
Lab1 |
ex1.1.jff |
Jan 26 |
| Chapter 2.2, 2.3 - NFAs |
Lab2 |
ex2.1.jff,
ex2.2.jff,
ex2.3.jff |
Feb 2 |
| Chapter 3.1 Regular Expressions |
Lab3 |
|
Feb. 7 |
| Chapter 3.2 Regular Languages |
Lab4 |
ex4.1.jff |
Feb. 9 |
| Chapter 4.1,4.2 Propeties of Regular Languages |
Lab5 |
|
Feb. 14 |
| Chapter 4.3 Regular Pumping Lemma |
Lab6 |
Pumping Lemma Script |
Feb 21 |
| Chapter 3.3,5.1,5.2 Grammars |
Lab7 |
lab7.zip |
Feb 28 |
| Exam 1 |
|
|
Mar 2 |
| Chapter 6.1, 6.2 CFG Normal Forms |
Lab8 |
ex8.1.jff |
Mar 7 |
| Chapter 7.1 Pushdown Automata |
Lab9 |
ex9.1.jff |
Mar 9 |
| Chapter 7.2 Equivalence of PDAs, CFLs |
Lab10 |
ex10.1.jff ,
ex10.2.jff |
Mar 21 |
| Chapter 8.1 Context-Free Pumping Lemma |
Lab11 |
|
Mar 28 |
| Chapter 8.2 Properties of CFLs |
Lab12 |
|
Mar 30 |
| Chapter 9.1, 10.1-10.3 Turing Machines |
Lab13 |
ex13.1.jff ,
ex13.2.jff |
Apr 6 |
| Chapter 10.4 A Universal TM |
Lab14 |
ex14-universal.jff ,
ex14.2.jff |
Apr 11 |
| Chapter 11.1 Recursive and Recursively Enumerable Languages |
Lab15 |
|
Apr 18 |
| Exam 2 |
|
|
Apr 20 |
| Chapter 12.1, 12.2 Undecidability |
Lab16 |
|
Apr 27 |
| Chapter 13 Other Models |
Lab17 |
|
May 2 |
| Chapter 14 - Computational Complexity |
Lab18 |
|
May 4 |
| Final |
|
|
TBA |