Regular expression to NDFA part 3 | TOC | lec-37
Advertisement
About this video
This video is part of the Theory of Computation (TOC) lecture series by Er Sahil Ka Gyan for RTU B.Tech students (4th Sem). It is video 38 of 74 in the series.
More from Theory of Computation (TOC)
4:0336
Conversion of regular expressions to NDFA in hindi | TOC | lec-35
2:4737
Regular expression to NDFA examples in hindi part 2 | TOC | lec-36
6:1439
Regular expression to DFA with example in hindi | TOC | lec-38
3:2740
Regular expression to DFA example part 2 in hindi | TOC | lec-39
4:3041
DFA to regular expression with example in hindi | arden's theorem | TOC | lec-40
3:4942
DFA to regular expression example part 2 | Finite automata to regular expression | TOC | lec-41
4:5043
Equivalence of regular expressions with example in hindi | TOC | lec-42
3:5944
Context free grammar in theory of computation in hindi | LMD and RMD | TOC | lec-43
Advertisement