Starting a new Lecture Notes Series on Mathematics - Formal Languages and Automata Theory
%20(1).png)
Youtube Lecture Playlist CreditsChannel Name: nptelhrd
So Let Us Start to This Journey of Learning
Mathematics - Formal Languages and Automata Theory By Lecture Notes together!
Lecture 1: Mod-01 Lec-01 Introduction
Lecture 2: Mod-01 Lec-02 Alphabet, Strings, Languages
Lecture 3: Mod-01 Lec-03 Finite Representation
Lecture 4: Mod-02 Lec-01 Grammars (CFG)
Lecture 5: Mod-02 Lec-02 Derivation Trees
Lecture 6: Mod-02 Lec-03 Regular Grammars
Lecture 7: Mod-03 Lec-01 Finite Automata
Lecture 9: Mod-03 Lec-03 NFA DFA
Lecture 10: Mod-04 Lec-01 Myhill-Nerode Theorem
Lecture 11: Mod-04 Lec-02 Minimization
Lecture 12: Mod-05 Lec-01 RE FA
Lecture 13: Mod-05 Lec-02 FA RE
Lecture 14: Mod-05 Lec-03 FA RG
Lecture 15: Mod-06 Lec-01 Variants of FA
Lecture 16: Mod-07 Lec-01 Closure Properties of RL
Lecture 17: Mod-07 Lec-02 Homomorphism
Lecture 18: Mod-07 Lec-03 Pumping Lemma
Lecture 19: Mod-08 Lec-01 Simplification of CFG
Lecture 20: Mod-08 Lec-02 Normal Forms of CFG
Lecture 21: Mod-09 Lec-01 Properties of CFLs
Lecture 22: Mod-10 Lec-01 Pushdown Automata
Lecture 23: Mod-10 Lec-02 PDA CFG
Lecture 25: Mod-11 Lec-02 Turing Computable Functions
Lecture 26: Mod-11 Lec-03 Combining Turing Machines
Lecture 27: Mod-11 Lec-04 Multi Input
Lecture 28: Mod-11 Lec-05 Turing Decidable Languages
Lecture 29: Mod-11 Lec-06 Varients of Turing Machines
Lecture 30: Mod-12 Lec-01 Structured Grammars
Lecture 31: Mod-13 Lec-01 Decidability
Lecture 32: Mod-13 Lec-02 Undecidability1
Lecture 33: Mod-13 Lec-03 Undecidability2
Lecture 34: Mod-13 Lec-04 Undecidability3
Lecture 35: Mod-14 Lec-01 Time Bounded Turing Machines
Lecture 36: Mod-14 Lec-02 P and NP
Lecture 37: Mod-14 Lec-03 NP-Completeness
Lecture 38: Mod-14 Lec-04 NP-Complete Problems1
Lecture 39: Mod-14 Lec-05 NP-Complete Problems2
Lecture 40: Mod-14 Lec-06 NP-Complete Problems3
Lecture 41: Mod-15 Lec-01 Chomsky Hierarchy