Week of |
Material Covered |
Remarks |
January 10 |
Introduction to Theory of Computing |
|
January 17 |
Mathematical review |
|
January 24 |
Finite automata |
|
January 31 |
Finite automata |
|
February 7 |
Regular Expressions and Languages |
|
February 14 |
Properties of Regular Languages |
Midterm |
February 21 |
Mid semester break |
No Classes |
February 28 |
Context Free Grammar and Languages |
|
March 7 |
Pushdown Automata |
|
March 14 |
Properties of Context-Free Languages |
|
March 21 |
Introduction to Turing Machines |
|
March 28 |
Undecidability and Intractable Problems |
|
April 4 |
Review |
|