Theory of Computation: Minimized DFA 

Best video on this topic. You explained it in a very easy and diff way. Thank you madam !

she explains with piece of paper better than channels with expensive animations or they who use light pen

nice explanation but we can remove D state first bcz D is unreachable state

very clear mam.. even our lecturers also follow your videos to teach us

What will happen if a State doesn't have any one of input, let's say I is in this diagram, and there's no transition from I with 0 input, which group should we put I

why canr B and C be in same group both corresponds to 1 2 respectively

The best explanation... Thank you so much

why don't we remove the unreachable states in the starting like d state is unreachable so shouldn't we remove it??

d is unreachable state and should be removed right ?

why didnt you cut off state D at first as it is unreachable?

If it has more than 1 final state what can do mam ?

Nice class very understandable ❤️mam

Very easy explanation

Mam.... classes are excellent... why unreachable state D is not removed?... pls explain

Best explaination ever thanks a lot👍

Pls make vdo on moore n mealy machine

Hi mam Two final State vantha epadi pananum mam

Great explanation!

A literal Godsend when i know nothing

but Madam D is not rechable why did'nt you eliminate it?

Awesome mam

Nice class , thank u mam

Thank you very much mam ❤

thank you

Very good madam

Superr mam

Thank you mam

👌👌👌👌👌

Tq mam

❤️‍🩹✨

Mam How to solve minimize dfa in table filling method

👍👍👍👍👍👍