Additional slides used in CS 301 Languages and Automata

• PDFs of class slides.
  1. Lecture-01-Introduction
  2. Lecture-02-DFA
  3. Lecture-03-NFA
  4. Lecture-04-regex
  5. Lecture-05-applications
  6. Lecture-06-pumping-lemma
  7. Lecture-07-closure-properties
  8. Lecture-08-regular-languages
  9. Lecture-09-cfg
  10. Lecture-10-cnf
  11. Lecture-11-review
  12. Lecture-12-pda
  13. Lecture-13-cfl
  14. Lecture-14-noncfl
  15. Lecture-16-tm-variants
  16. Lecture-17-church-turing
  17. Lecture-18-decidable
  18. Lecture-19-undecidable
  19. Lecture-20-reductions
  20. Lecture-21-review
  21. Lecture-22-mapping-reductions
  22. Lecture-23-time-complexity
  23. Lecture-24-np
  24. Lecture-25-np-complete