filmov
tv
Lec -16 | Minimization of Deterministic Finite Automata (DFA)
Показать описание
TOC: Minimization of Deterministic Finite Automata (DFA) in Theory of Computation.
Topics discussed:
1) Minimization of DFA.
2) Need for minimization.
3) Equivalence of states.
Important Videos For New YouTubers:
About Course
In this course Theory of Computation is started by our educator Prof. Dinesh Singh Dhakar. He is going to teach Theory of computation GATE Lectures. Theory of computation will be in Hindi. The topics like Finite Automata, Context Free Grammar, Turing Machine and many more topics with GATE Examples will be Covered. Our whole focus will be to cover more and more examples which will clear your logic and currently we are focusing on Computer Science GATE subjects soon and as it completes we will add more lectures for other branches on TechEducation 4U.
Hi
I am Dinesh Singh Dhakar welcome to our channel 'Prof Dinesh Dhakad[Ph.D. MTech C-DAC BTech]'
our social links:-
Facebook Accounts:
Topics discussed:
1) Minimization of DFA.
2) Need for minimization.
3) Equivalence of states.
Important Videos For New YouTubers:
About Course
In this course Theory of Computation is started by our educator Prof. Dinesh Singh Dhakar. He is going to teach Theory of computation GATE Lectures. Theory of computation will be in Hindi. The topics like Finite Automata, Context Free Grammar, Turing Machine and many more topics with GATE Examples will be Covered. Our whole focus will be to cover more and more examples which will clear your logic and currently we are focusing on Computer Science GATE subjects soon and as it completes we will add more lectures for other branches on TechEducation 4U.
Hi
I am Dinesh Singh Dhakar welcome to our channel 'Prof Dinesh Dhakad[Ph.D. MTech C-DAC BTech]'
our social links:-
Facebook Accounts:
0:27:44
0:08:32
0:17:36
0:09:37
0:09:24
0:48:49
0:17:24
0:17:10
1:10:48
0:42:42
0:26:39
0:56:34
0:43:55
0:27:41
0:17:19
0:51:10
0:49:37
1:40:05
0:48:51
1:12:40
1:01:14
0:22:53
1:45:33
0:41:46