DFA of all binary number divisible by 3 | TOC | lec-29
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 30 of 74 in the series.
More from Theory of Computation (TOC)
2:3928
DFA for word start and end with different Character | TOC | lec-27
2:4829
DFA divisible by 2 | TOC | lec-28
3:3331
DFA divisible by 5 Short trick | TOC | lec-30
2:1632
DFA for even numbers of 0's and even numbers of 1's | TOC | lec-31
5:4533
Elimination of null moves from NDFA in TOC | Lec-32
3:2634
Regular grammar for a given DFA in TOC | lec-33
3:3135
DFA for given regular expression in TOC | lec-34
4:0336
Conversion of regular expressions to NDFA in hindi | TOC | lec-35
Advertisement