GATE & ESE
Free courses
CS & IT
Theory of Computation
Lesson 3 of 6 • 1 upvotes • 12:08mins
In this we discuss about two examples in which we convert NFA to DFA
6 lessons • 1h 7m
Course Overview (in Hindi)
3:44mins
Minimization of DFA (in Hindi)
15:00mins
Conversion of NFA to DFA (in Hindi)
12:08mins
Moore Machine (in Hindi)
13:58mins
Mealy Machine (in Hindi)
14:16mins
Conversion of Moore to mealy Machine
8:37mins