Conversion from NFA to DFA | Equivalence of DFA and NFA | Subset Construction Method
18:29
Convertion of ε-NFA to DFA | Epsilon NFA to DFA Conversion | Theory of Computation
35:43
Minimization of DFA | Myhill-Nerode Theorem | Table Filling Method | Theory of Computation
16:25
Conversion of NFA with ε to without ε-NFA | Theory of Computation
33:25
Classification of States Part - 2
9:29
Pumping Lemma for Regular Language | Proving Languages to be not Regular | Theory of Computation
41:44
Conversion of DFA to RE | Regular Expression equation method Rijk | Theory of Computation
11:50
Converting Regular expression to Finite automata(NFA) | Thompson’s Construction
5:53