91.304 : Foundations of Computer Science
Topics
Assignments

Homework #1

Homework #2 DFAs, NFAs, transition functions
(T()), Regular Expressions (REs), Minimum DFA, Converting from each to
every other.

Homework #3 Pumping Lemma, Context Free Grammars
(CFG), Chomsky Normal Form (CNF), Greibach Normal Form.

Homework #4 Pushdown Automata (PDA).

Homework #5 Turing Machines and Partial
Recursive Functions.

Homework #6 Pumping Lemma for ContextFree
Languages.

Homework #7 Undecidability

Homework #8 Complexity
Quizes

Quiz #1

Quiz #2

Quiz #3

Quiz #4
Exams

Midterm

Final