8. DFA Minimization using Equivalence method

[@balewgizem]

Thank you very match. I have exam tomorrow and you saved me.

[@CSEGURUS]

Glad it helped.

[@driosman]

Simple and Nice Explanation, thanks for the input

[@sowjisowjii6836]

We will ignore one state if it doesn't have path from intial state what if that state is final state

[@nehaamehta5080]

q3 should be marked unreachable from q0 not q5 right?

[@rohithvaidya1878]

sir your video is perfect but please increase its font size

[@CSEGURUS]

Thank you for ur feedback.. I vl do it for next videos

[@aldrinjenson]

Thank You

[@CSEGURUS]

You're welcome...Watch Turing Machine problems in the following link www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?

[@dhanashreeshelke1319]

sir video ka voice bohot kam hai

[@shad491]

nice

[@CSEGURUS]

Thank u... Watch Turing Machine problems in the following link www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?

[@nihalajasmin6036]

This is wrong I think 3rd equalance ..q0 ,q2 are not equalant

[@ibtsachid9814]

no, they are equivalent. simply by observing transition table also we can say that they are eqvi

[@akhilsatya1930]

yes its wrong

[@payalkaur779]

thankyou

[@CSEGURUS]

Most welcome..Watch Turing Machine problems in the following link www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?

[@chintalamounika4711]

Sir you did some mistakes

[@satheesh3266]

can you please tell what are they??

[@chaitanyaseesala6499]

@@satheesh3266 you missed Q5 state sir.

[@seemaverma279]

@@chaitanyaseesala6499 it's a dead state

[@shad491]

thanks

[@CSEGURUS]

You're welcome!... Watch Turing Machine problems in the following link www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?