Channel
›

## Theory Of Computation 13,DFA of strings which starts with 'ab'

3m 58s 78,313 View In this video I have discussed about how to construct minimal DFA which accepts set of all strings over {a,b} where each string starts with 'ab'.## Theory Of Computation 15, DFA of strings which ends with 'ab'

4m 11s 84,946 View In this video I have discussed about how to construct minimal DFA which accepts set of all strings over {a,b} where each string ends with 'ab'.## Career Guidance

3m 25s 26,980 View Please fill the form at http://ravindrababuravula.com/feedback.php to get a call from our career guidance experts.## Theory Of Computation 34,Examples of NFA

5m 26s 142,345 View In this video I have discussed examples of NFA How to contruct NFA for set of all strings over {a,b} which (i) starts with 'a' (ii) containing 'a' (iii)ends with 'a' (iv) starts with 'ab' (v)...## Algorithms Lecture 1 -- Introduction to asymptotic notations

22m 27s 1,013,252 View In this video big-oh, big-omega and theta are discussed.## Free Machine Learning classes in Hyderabad

3m 2s 34,451 View Free Machine Learning classes in Hyderabad.## Theory Of Computation 43,Minimization of DFA

3m 39s 78,073 View Minimization of DFA example 3.## Theory Of Computation 9,DFA of strings which starts with 'a'

3m 50s 89,980 View In this video I have discussed about how to construct minimal DFA which accepts set of all strings over {a,b} where each string starts with an 'a'.## How to revise and remember the topics for long!!

12m 18s 211,558 View The professors I was talking about in this video were Dr Barbara Oakley and Dr Terrance.## Theory Of Computation 46,Moore Machine and Mealy machine

7m 15s 185,330 View Introduction to Moore and Mealy Machine.## Theory Of Computation 17,DFA which accepts string staring and ending with different sysmbol

5m 59s 75,405 View In this video I have discussed about how to construct minimal DFA which accepts set of all strings over {a,b} where each string starts and ends with different symbols.## Theory Of Computation 7,DFA of binary no which is divisible by 3

8m 21s 156,412 View In this video I have discussed about how to construct minimal DFA which accepts set of all strings over {0,1} which when interpreted as a binary number is divisible by 3.