| Assignment |
Link |
Deadline |
Comments |
Solution |
| Discrete Math background |
Set1 |
9/23 |
This homework is optional if you have the required background. |
|
| DFA |
Set2 |
9/9 |
|
|
| Minimizing DFAs, NFAs, DFA-NFA equivalence |
Set3 |
10/2 |
|
|
| Regular expressions, equivalence with FA |
Set4 |
10/2 |
Question 1c was missing a parenthesis (observe the change) |
|
| Context-Free Grammars |
Set5 |
10/21 |
|
|
| Context-Free Grammars & NPDA |
Set6 |
10/28 |
CYK algorithm is in slides about Compilers and Parsers |
|
| NPDAs and Turing Machines |
Set7 |
11/13 |
Different version than the one I sent you by email |
|
| Turing Machines |
Set8 |
11/13 |
Study from the slides about partially comutable functions and k-ary functions first.
Symbol * denotes a difficult question |
|
| Complexity \& O-Notation |
Set9 |
11/25 |
|
|