Equivalence of Two finite automata with Example I TOC | lec-10
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 11 of 74 in the series.
More from Theory of Computation (TOC)
5:409
NFA with null moves to DFA conversion l TOC | lec-8
5:3010
NFA with null moves to DFA example 2 l TOC | lec-9
3:1012
Equivalence of Two finite automata example 2 l TOC | lec-11
7:3213
Minimization of DFA in theory of computation I TOC | lec-12
5:4614
Minimization of DFA example 2 l TOC | lec-13
6:4315
Finite Automata with Output l Moore, Mealy machine l TOC | Lec-14
4:5916
Moore to Mealy conversion with Example l TOC | lec-15
5:4917
Mealy to Moore Conversion with example l TOC | lec-16
Advertisement