Theory of Computation: Minimized DFA

preview_player
Показать описание

Рекомендации по теме
Комментарии
Автор

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

mynkyt
Автор

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

radmehrvosoughi
Автор

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

yoshitha
Автор

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

mdadilraza
Автор

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

sakthipriya
Автор

The best explanation... Thank you so much

sanas.
Автор

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

vaishakhsz
Автор

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

ShemlaA
Автор

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

farhana
Автор

d is unreachable state and should be removed right ?

shahad
Автор

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

sgautam
Автор

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

SangamithraT
Автор

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

aftabtai
Автор

Hi mam
Two final State vantha epadi pananum mam

EMIYAMMAL.Demiyammal
Автор

Mam How to solve minimize dfa in table filling method

moulyamoulya