91.304 : Foundations of Computer Science


Topics

Assignments

  1. Homework #1
  2. Homework #2 DFAs, NFAs, transition functions (T()), Regular Expressions (REs), Minimum DFA, Converting from each to every other.
  3. Homework #3 Pumping Lemma, Context Free Grammars (CFG), Chomsky Normal Form (CNF), Greibach Normal Form.
  4. Homework #4 Pushdown Automata (PDA).
  5. Homework #5 Turing Machines and Partial Recursive Functions.
  6. Homework #6 Pumping Lemma for Context-Free Languages.
  7. Homework #7 Undecidability
  8. Homework #8 Complexity

Quizes

  1. Quiz #1
  2. Quiz #2
  3. Quiz #3
  4. Quiz #4

Exams

  1. Midterm
  2. Final