Theory of Computation: NFA to DFA conversion (Subset Construction Method)

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

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

maam you are a literal lifesaver.. i watched so many videos but couldnt understand dfa and automata problems at all until i visted your channel.. wonderful explanation you have. Thank you so much as i'll pass in vtu because of you

asnakhan
Автор

Madam camera is moving up and down and it's blurring in middle but your explanation very good

tejapandruvada
Автор

Superb explanation 🤩
Watching your videos from the beginning of the playlist.
Thank you ma'am.

AkGautam_
Автор

From bottom of heart thank you so much mam.

Riteshdumane
Автор

your way of teaching is superb but camera can cause motion sickness to me
plz change camera

mayanksingh
Автор

Awesome explain 🙌each steps you explained very well mam ❤️

keerthanagayu
Автор

Thankyou sm😭 omg this u made it so easyyy

khadijamomin
Автор

Equivalence of nfa to dfa Same.. Maa with conversion of nfa to dfa?

meghanadasari-ywci
Автор

What happen 2^n states are not completing in transition graph of DFA is it wrong means in Lambada transition?

ayeshabilal
Автор

Mam Agar single state pr bracket na lgya toh chalega kya???

Shantanu_lrnr
Автор

What if i make the table for excessible state rather then all 2 power n?

innovatorshome
Автор

thanks for the beautiful explanation!!

omanshsharma
Автор

Ma'am set the camera to manual focus please thank you

leonelmessi
Автор

Madam meeru nfa to dfa conversion cheppeyaru

meghanadasari-ywci