Minimization of DFA (With Unreachable States)

TOC: Minimization of DFA (When there are Unreachable States)

This lecture explains what is an Unreachable State and how to minimize a DFA when there are unreachable states involved.

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

[keshavdamani]

come in our college, we need real techers

[jeevapriya]

Many students are struggling to understand ur videos makes it simple make videos on computer hardwares ...

[abhijeetsharma]

Consider the states that have incoming edges but only from other unreachable states. Won't they be unreachable as well?
So, to say "all states not having any incoming edge are unreachable" is correct but,
"unreachable states have no incoming edge"(0:56) should be incorrect. Isn't it?

[aryansawant]

My college teacher did it without removing the unreachable state is that correct???

[mnaresh]

Why is g not one equivalent, we can see both E ang G have same transition states so, shouldn't we include include as one equivalence to the set A, D, E 2:59

[LordSarcasticVlogger]

Please come to NIT SRINAGAR to teach us….We need You

[ronthedon]

Thank you for this course.
did i miss it, or you do not touch the subject of epsilon transitions and removing epsilon transition ? if you do, can you please tell me in which lecture do you touch the subject?

thanks again!

[Sado]

i don't know why but removing F made me sad

[pratyushdas]

So, we just remove the unreachable state and proceed as usual? Is there anything else that needs to be done?

[saidasalima]

State D, E and G both are going to state G for 0, 1 input. Can we make it one single state like state DEG as the next state is same.

[muthumeena]

DG is equivalent to each other.I have one doubt sir, canI write 2 equivalence as {A}, {B, C}, {D, G, E}.Is it correct. Else, plz clear my doubt sir .

[bansishah]

you mentioned in one of your videos that any input cannot go in 2 simultaneous states at the same time. So when we write {D, E}, {B, C} etc, are we performing a union ?

[ZerBrains]

Sir if we not removing unreachable and we solve that normal then there is a effect in minimised states or not Please reply sir??

[risingsingh]

In example 3 of minimising dfa to nfa the state A AND STATTE B ON INPUT 0. And 1 have different state are still being collected as a single state ?
How it is possible

[shubhamsunny]

a 3:46, why we r finding next equvalance, , bcz in equvalance 0 and 1, 1st set is same...why sir?

[nabhavlogs]

Will we put the unreachable state once we have made the minimized DFA?

[Therealmanraj]

Why is {D, E, G} not possible? 
All of them have the same G common in the table.

[apostolosmavropoulos]

can we minize a dfa with unreachable states using the table filling method?

[rk]

advertisement is awesome.... so is your

[smpyasi]

Sir in a lecture of conversion of NFA to DFA you said that in DFA we can pass only one input at a time if it isn't then it is a NFA. Same in this problem more than one input are passing through one state so why we calling it a DFA it simply maybe a NFA then . Sir please clear this confusion 😭