Equivalence of regular expressions with example in hindi | TOC | lec-42
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 43 of 74 in the series.
More from Theory of Computation (TOC)
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
3:5944
Context free grammar in theory of computation in hindi | LMD and RMD | TOC | lec-43
3:0745
Context Free Language and Ambiguity in theory of computation | TOC | lec-44
2:5846
Elimination of Ambiguity in CFG | Simplification of CFG | TOC | lec-45
3:4847
Elimination of left recursion in CFG | TOC | lec-46
2:5448
Elimination of left factoring in CFG | TOC | lec-47
2:4649
Elimination of useless symbol in CFG | TOC | lec-48
Advertisement