CECS 329 Lectures

  1. Undecidability
  2. Undecidability (Annotated)
  3. Decidability
  4. Decidability (Annotated)
  5. Turing Machines (Annotated Part 2 Starting at Page 9)
  6. Turing Machines (Annotated)
  7. Turing Machines
  8. DFA to Regular Expression and DFA to CFL Examples
  9. Context Free Languages (Annotated)
  10. Context Free Languages
  11. Converting and NFA to a Regular Expression (Starts on Page 4)
  12. Equivalence Between Regular Languages and Regular Expressions (Annotated)
  13. Equivalence Between Regular Languages and Regular Expressions
  14. Language Operations and Regular Expressions (Annotated)
  15. Language Operations and Regular Expressions
  16. Nondterministic Finite Automata (Annotated)
  17. Nondeterministic Finite Automata
  18. Deterministic Finite Automata (Annotated)
  19. Deterministic Finite Automata
  20. NP Complete Problems (Annotated)
  21. NP Complete Problems
  22. Introduction to Complexity Theory (Annotated)
  23. Introduction to Complexity Theory
  24. Mapping Reducibility (Annotated)
  25. Mapping Reducibility
  26. Logic Problems Both Easy and Hard (updated version of the lecture that is annotated starting on page 5)
  27. Logic Problems Both Easy and Hard (Annotated Pages 1-4)
  28. Logic Problems Both Easy and Hard