Learn · Formal Languages and Automata Theory

Lecture 12 of 41RL ? RG ? FA

RE => FA

Dr. K.V. Krishna and Dr. Diganta Goswami · IIT Guwahati

Credits and licence

From
Formal Languages and Automata Theory, IIT Guwahati (at NPTEL)
Licence
CC BY-NC-SA, as NPTEL states it. Non-commercial use only.
Attribution
NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge.
Who can watch
Tweens profiles and older. How courses are placed

All the lectures

  1. Introduction Video
  2. Alphabet, Strings, Languages Video
  3. Finite Representation Video
  4. Grammars (CFG) Video
  5. Derivation Trees Video
  6. Regular Grammars Video
  7. Finite Automata Video
  8. Nondeterministic Finite Automata Video
  9. NFA DFA Video
  10. Myhill-Nerode Theorem Video
  11. Minimization Video
  12. RE => FA Video
  13. FA => RE Video
  14. FA RG Video
  15. Variants of FA Video
  16. Closure Properties of RL Video
  17. Homomorphism Video
  18. Pumping Lemma Video
  19. Simplification of CFG Video
  20. Normal Forms of CFG Video
  21. Properties of CFLs Video
  22. Pushdown Automata Video
  23. PDA CFG Video
  24. Turing Machines Video
  25. Turing Computable Functions Video
  26. Combining Turing Machines Video
  27. Multi Input Video
  28. Turing Decidable Languages Video
  29. Varients of Turing Machines Video
  30. Structured Grammars Video
  31. Decidability Video
  32. Undecidability1 Video
  33. Undecidability2 Video
  34. Undecidability3 Video
  35. Time Bounded Turing Machines Video
  36. P and NP Video
  37. NP-Completeness Video
  38. NP-Complete Problems1 Video
  39. NP-Complete Problems2 Video
  40. NP-Complete Problems3 Video
  41. Chomsky Hierarchy Video