Video Lectures
Chapter 1 : Automata Theory
Topic : Automata Theory
Content : Defining Automaton, Finite Automaton, Transitions Properties, Acceptability By Finite Automaton
153 MB ,1:1:10 MIN , THEORY
Chapter 1 : Automata Theory
Topic : Acceptability By Automata
Content : Examples of Automata And Understanding Languages
82 MB ,21:34 MIN , THEORY
Chapter 1 : Automata Theory
Topic : NFA ,NFA And DFA Equivalance
Content : NFA,NFA and DFA Equivalence
121 MB ,1:0:42 MIN , THEORY
Chapter 1 : Automata Theory
Topic : DFA Minimization
Content : DFA Minimization Basics And Examples
103 MB ,39:46 MIN , THEORY
Chapter 1 : Automata Theory
Topic : Operations On DFA
Content : Operations On DFA
58 MB ,35:8 MIN , THEORY
Chapter 2 : Formal Languages
Topic : Recursive Enumerable Sets
Content : Recursive Enumerable Language And Recursive Language
10 MB ,5:25 MIN , THEORY
Chapter 2 : Formal Languages
Topic : Chomsky Classification Of Grammar And Languages
Content : Chomsky Classification Of Grammar And Languages
81 MB ,37:35 MIN , THEORY
Chapter 1 : Automata Theory
Topic : Acceptability By Automata
Content : DFA Complementation
57 MB ,36:7 MIN , THEORY
Chapter 1 : Automata Theory
Topic : Mealy And Moore Machine
Content : Moore Examples
56 MB ,30:5 MIN , THEORY
Chapter 2 : Formal Languages
Topic : Defining Grammar,Derivations
Content : Defining Grammar,Derivations
113 MB ,58:29 MIN , THEORY
Chapter 1 : Regular sets and Regular Grammar
Topic : Regular Grammar
Content : Introduction To Regular Grammar, Types Of Regular Grammar, RG To FA And FA To RG Conversion
37 MB ,24:16 MIN , THEORY
Chapter 1 : Regular sets and Regular Grammar
Topic : Pumping Lemma And Its Application
Content : Pumping Lemma For Regular Languages
43 MB ,22:16 MIN , THEORY
Chapter 3 : PushDownAutomata
Topic : PDA And CGF
Content : Equivalence Of PDA-CFG: Conversion Of PDA To CFG
120 MB ,43:55 MIN , THEORY
Chapter 2 : Context Free Languages:
Topic : Pumping Lemma For CFG
Content : Pumping Lemma For CFG
59 MB ,31:41 MIN , THEORY
Chapter 1 : Regular sets and Regular Grammar
Topic : Finite Automata And Regular Expression
Content : Finite Automata To RE Conversion (Arden's Theorem)
68 MB ,39:3 MIN , THEORY
Chapter 2 : Context Free Languages:
Topic : CFG Simplification
Content : Epsilon-Removal, Unit Production Elimination, And Useless Symbol Elimination
59 MB ,32:12 MIN , THEORY
Chapter 2 : Turing Machine
Topic : Turing machine Definition, Representation and Design Of Turing Machine
Content : Turing machine Definition, Representation, And Design Of Turing Machine
189 MB ,43:4 MIN , THEORY
Chapter 2 : Turing Machine
Topic : Construction Of Turing Machines
Content : Examples Of Turing Machine
72 MB ,34:2 MIN , THEORY
Chapter 2 : Turing Machine
Topic : Variants Of Turing Machine
Content : Variants Of Turing Machine
33 MB ,18:46 MIN , THEORY
Chapter 3 : Undecidability
Topic : Introduction To Unsolvable Problems
Content : Introduction To Unsolvable Problems( P , Np ,Np Hard And NP Complete)
29 MB ,14:12 MIN , THEORY
Chapter 1 : Automata Theory
Topic : Acceptability By Finite Automata
Content : Examples For Starting And Ending Patterns
81 MB ,26:19 MIN , THEORY
