Syllabus
| WEEK | TOPICS |
|---|---|
| 1 |
Finite Automata |
| 2 |
Nondeterminism |
| 3 |
Regular Languages |
| 4 |
Regular Expressions |
| 5 |
Pumping Lemma |
| 6 |
Context-Free Grammars |
| 7 |
Different Forms of Grammars |
| 8 |
Pushdown Automata |
| 9 |
Non-Context-Free Languages |
| 10 |
Turing Machines I |
| 11 |
Turing Machines II |
| 12 |
An Undecidable Language |
| 13 |
P and NP |
| 14 |
NP-Complete Problems |