CECS 329 Lectures

  1. Turing Reducibility
  2. Turing Reducibility (Annotated)
  3. Turing Reducibility (Annotated Friday)
  4. Mapping Reducibility
  5. Mapping Reducibility (Annotated)
  6. Mapping Reducibility (Annotated Friday)
  7. Introduction to Complexity Theory
  8. Introduction to Complexity Theory (Annotated)
  9. Introduction to Complexity Theory (Annotated Friday)
  10. NP Complete Problems
  11. NP Complete Problems (Annotated)
  12. NP Complete Problems (Annotated Friday)
  13. Deterministic Finite Automata
  14. Deterministic Finite Automata (Annotated)
  15. Nondeterministic Finite Automata
  16. Nondterministic Finite Automata (Annotated)
  17. Nondeterministic Finite Automata (Annotated Friday)
  18. Language Operations and Regular Expressions
  19. Language Operations and Regular Expressions (Annotated)
  20. Language Operations and Regular Expressions (Annotated Friday)
  21. Equivalence Between Regular Languages and Regular Expressions
  22. Equivalence Between Regular Languages and Regular Expressions (Annotated Pages 1-10)
  23. Equivalence Between Regular Languages and Regular Expressions (Annotated Pages 11-16)
  24. Equivalence Between Regular Languages and Regular Expressions (Annotated Friday)
  25. Converting and NFA to a Regular Expression (Starts on Page 4)
  26. Context Free Languages
  27. Context Free Languages (Annotated)
  28. Context Free Languages (Annotated Friday)
  29. Context Free Languages (Chomsky Normal Form Annotation)
  30. Turing Machines
  31. Turing Machines (Annotated)
  32. Turing Machines (Annotated Friday)
  33. Turing Machines (Annotated 11/18)
  34. Decidability
  35. Decidability (Annotated)
  36. Decidability (Annotated Thursday December 4th)
  37. Decidability (Annotated Friday)
  38. Undecidability
  39. Undecidability (Annotated)
  40. Accept CFG Example