Pre-requisites of Minimization of DFA: Dead State, Inaccessible State, Indistinguishable State

[@studymania734]

thank you

[@shubhonlinevlogs57]

Nice explain Chachi plz keep uploading 👍

[@shaiksameerroshan9678]

big fan big fan mam

[@dushimesouvenir1673]

thanks

[@hayleyesthertaylor9331]

Well explained - thanks for this

[@sdp_rjk]

It's helpful and easy to understand.. Thank you mam

[@SunSin]

Thanks a lot.

[@satya-official]

If we remove the dead state then what to do with the incoming transitions from other states ? if we remove them the DFA become a NDFA .............

[@SunSin]

Thanks for your query. When we eliminate a dead state, say q6, then we also eliminate all the incoming transtitions to that state,q6. If there are outiong transitions also then these will lead to another dead state. If not, then definitely, q6 will not be a dead state. Hope this will help.

[@satya-official]

@@SunSin Too Late... Actually I don't remember the question that I asked. I will take a look.

[@Chinnu102]

😊

[@AdeshPaul]

Thanks. Regarding partition method if there is a dead state in this F.A. then do we have to separate it in the next equivalence?

[@SunSin]

Thanks for your query. In equivalence class method, we do not need to eliminate or separate dead state or inaccessible state at any point. These states will be dissolved by default. Kindly refer to my video on this topic.

[@arshradhanpura8663]

Thank you !!!

[@Ankit-mq6em]

Mam in language when to consider epsilon and when not pls give explanation

[@kishorkumarsingh9072]

Very nicely explained

[@SunSin]

Thanks a lot

[@avikkumardas9519]

❤❤❤❤

[@newbiehype4505]

2023 ! 🍬🌟

[@tirupathi5753]

u r Vedios very very useful Madam..Thanks you so much Madam...Pls give me ur fb or insta id