|
- Assignment 12:
PTime reductions and NP-Completeness
Optional submission deadline: 23:59, T Dec 10
- Assignment 11:
Computable reductions
Due: 23:59, T Dec 3
Solutions
- Assignment 10:
Undecidability
Due: 23:59, F Nov 23
Solutions
- Assignment 09:
PDA, Chomsky's Hierarchy
Due: 23:59, F Nov 15
Solutions
- Assignment 08:
Parse trees and dual clipping
Due: 23:59, F Nov 8
Solutions
- Assignment 07:
Context free grammars
Due: 23:59, F Nov 1
Solutions
- Assignment 06:
Machines and traces
Due: 23:59, F Oct 18
Solutions
- Assignment 05:
Regular languages
Due: 23:59, F Oct 11
Solutions
- Assignment 04:
Automata and residues
Due: 23:59, F Oct 4
Solutions
- Assignment 03:
Induction and recurrence
Due: 23:59, F Sep 26
Solutions
- Assignment 02:
Relations and mappings
Due: 23:59 F Sep 20.
Solutions
- Assignment 01:
Languages and sets
Due: 23:59 F Sep 6.
Solutions
|
