Minimization of DFA (With Multiple Final States)

TOC: Minimization of DFA (Multiple Final States)

This lecture shows how to minimize a DFA when there are more than one Final States involved. The steps are demonstrated using an example.

Music:
Axol x Alex Skrindo - You [NCS Release]

[aboutknowledge]

i have completed first then i saw the whole lecture and my minimized dfa was same :D feeling happy

[_md.shabuktahaidereric]

Hats off guys, you really found every possible types of questions from easy to hard. Specially this one, in previous example I was thinking those are easy one, how do you solve this kind of hard question, Trust me this is the one I was searching for. You have covered them all.. Lots of love guys. This is why Neso Academy is the best and most trustable.

[EnsArt]

My lecturer copies same questions and tutorials to teach us and I watch these ones to understand how awful situation isn't it?

[Thaihoc_coding]

So great. Easy to understand. Thank you

[juliendahomais]

GG BOI, TY SO MUCH YOU SAVE MY WHOLE UNIVERSITY YEAR YOU MUST BE BLESSED BY GOD !!

[aryanchauhan]

Thanku neso academy you are just awesome respect

[Rohit-eeqh]

Amazing and fabulous lectures you have the subject so easy to understand ❤.

[shoaibali]

Thanks a lot for sharing valuable knowledge.

[mohamadtabbakh]

General Question: What if we had 2 sets of final states? Let me clarify my question with an example. Suppose that instead of {A, B} {F} {C, D, E} we had {A, B} {F, E} {C, D}. Does the state {F, E} also become a final state? Another general question that's unerlated to this specific video. Can we have more than one initial state in an NFA since it's indeterministic?

[aadityapandey]

how can a and b be in the same set when there input string in not same and they are in different set
?? Expain

[ahmadazeem]

It was really helpful... well explained

[ChandanKumar-zljo]

Always towards respectfulable as you are given lecture so that a basic student can also be able to understand 🙏 always I like your teaching way ✨🙏 salute for always from my heart 🙏❤️ not for my university lecturer Thank You🙏.

[adityakrishna]

will all of the final states merge into one set in all instances or this one just lucked out?

[adorablewong]

is it possible to minimize DFA with only one input? input "a"

[DavidsonQWERTY]

what if one of my states does not uses all the alphabet? let us say that I have my alphabet {a, b, c} and I have 2 states: s0, that goes to s1 of receive f and s1 that goes to s2 and s4 if receive e and i respectively. My question is, s0 and s1 should belong to the same set or not?

[rymahimeurmima]

you're great, it was really very helpful. big thnx

[abhinavkumar]

what is the point of having F isn't it a dead state ??

[kayser_x]

What if one of the states has no transition 0 or 1? It's always considered as in the same when we compare?

[tung]

you saved my life sir, i just need to use 2 hours of my life to finish the same course in school which makes me waste 3 months of my life

[sheikhmuhammadbilal]

What if c, d, e were not together but c, d together and e with some other in a minimized dfa. Would we make every both states as final states?