Conversion of Regular expression to Finite Automata using Direct Method || Theory of computation
4:27
Regular Grammar || Left Linear Grammar || Right Linear|| Theory of Computation || TOC || FLAT
10:52
Conversion of Finite Automata to Regular Expression using Arden's Method || TOC || FLAT
4:56
Converting Regular Expression to Finite Automata using Subset method || Theory of Computation
13:18
Chomsky Normal Form || Converting CFG to CNF || Ex 2 || TOC || FLAT || Theory of Computation
15:56
Converting NFA to DFA || Equivalence of DFA and NFA || Theory of Computation || TOC || FLAT
5:08
RE (regular expression) to E -NFA | ಕನ್ನಡ explination | theory of computation
19:28
TOC Lec 12-Regular Expression to DFA by Deeba kannan
12:03