Theory of Computation / Automata Theory

Full Length Lecture Videos

Ultimate Information Security Course

44 Videos

Short Explainer Videos

Ultimate Information Security Course

14 Videos

Topic Wise Notes

  1. Lecture 1 Intro
  2. Lecture 2 Basics of FSM
  3. Lecture 3 Basic Problems on FSM
  4. Lecture 4 Basics Problems on FSM
  5. Lecture 5 Regular languages and expressions
  6. Lecture 6 Regular languages and expressions
  7. Lecture 7 Arden’s Theorem (FA to RE)
  8. Lecture 8 DFA Minimization
  9. Lecture 9 DFA Minimization and NFA to DFA
  10. Lecture 10 NFA to DFA and Myhill Nerode
  11. Lecture 11 Moore and Mealy Machines
  12. Lecture 12 Moore Machines and Conversions
  13. Lecture 13 Moore Machines and Conversions and Pumping Lemma
  14. Lecture 14 Module 3 Regular Grammars
  15. Lecture 14 Pumping Lemma
  16. Lecture 15 Module 3 Regular Grammars
  17. Lecture 16 Module 3 Regular Grammars
  18. Lecture 17 Module 3 Simplification of Grammars
  19. Lecture 18 Module 3 Normal Forms
  20. Lecture 19 Module 4 Push Down Automata
  21. Lecture 20 Module 4 Push Down Automata
  22. Lecture 21-23 Module 4 CFG to PDA
  23. Lecture 24 Module 5 Turing Machines
  24. Lecture 25 Module 4 CFG to PDA
  25. Lecture 26 – 30 Module 5 Turing Machines