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