TOC Lec 07-NFA to DFA conversion using subset construction by Deeba Kannan 

THANK YOU. You explained it perfectly, 12 minutes ago I did not know how to do this, but this 1 video had everything I needed to learn the subset construction method.

This subset method u have tought in an fabulous manner let God bless u with a good health and wealth. Ammen

Really, really good explanation of a difficult topic. Thank you very much!

wow Thank You so much such a great explanation love and respect from the USA.

WOw Last minute saver you are !! ;0 THANKS A LOT

Thank you so much, ma'am! The explanation was very precise and clear!

Thanks a lot mam It's very easy to understand your teaching 👏👏👏👏👏👏👏

Maam your way of explanation is very good as well as your voice is also very melody ...

This is exactly what I need!!!!!! Thank you for this great video!!!!!!!!

Understood it in one go....well explained!😊

Only because of your video I have cleared my degree in 2018

Super clean and understandable lecturers thank you madam

Hmm.. voice is clear and fluent. Right the way we understand. Good explanation.

Thank you so much ma’am for this detailed explanation.

thank you so much madam .Your explaination is very good .Please upload more on finite automata

Thank you Soo much ma'am ,the explanation was very good , you made this problem so easy . Please upload more videos on finite automata .

Your videos are gold..😭❤️

Thank you so much! This video helped me a lot❤️

Great job. ma'am. I enjoy your amazing lecture.

my exam was online, just came and watched this ez ty :)

Your explanation was very clear ma'am

What if there are more than 3 states in the question 🥴

thank you for the explanation! very good! Congrats!

Learnt a lot from your video. Thank you

Thanks for the good teaching.

Great explanation ma'am 😊

THANK YOU SO MUCH! My final is in 15 mins omgggg this was a big help :)

Thank you for this great video!! you explained very well !!!!!

Very well explained, thank you so much!!

you make it so easy. thank you so mach dear Deeba :* :*

Thank you from Thailand.

wow what a simple & clear explaination

Veryyy niceee ND clearly understand video really God bless u

Tquuu soo much sister... Love from karnataka 😊... Ur awesome sister...

Thank you so much for making me understand

Maam is it necessary that for an NFA with n states, its DFA will have exactly 2^n or can the dfa states be less than 2^n as well?

Awesome explanation ma'am...

from kerala.................thank maam

Nice explanation

Thank You it will help me in Compiler Design

Thanks for your nice explanation

You are very good!

Excellent madam

great explanation mam..thank you

Thank You Mam very helpful

Great explanation, thanks a lot!

deeba kanna bless you! you are the most amazing person in the world

Excellent explanation.

Osm explain mam super

Thank You So much Madam please Upload more about Auto meta theory And Touring Machine

Thank you ma'am..., after watching your vedios for reference I passed my semester exam... once again thank you ma'am....

Thank u so much mam..it is really helpful

omg you have mind blown me, thank you very much

well understanding

Great explanation thank you

This was too helpful.

You got a subscriber

Nice

I understand after i gave my exam 🙂 but happy for my future 💖

Faith in humanity restored .Thank you ma'am

Conplexxx , 😱. There is a easy method.

Thanxs maam can u upload more video on construction of naf

thank you :D saved my homework

thank you that was amazing

@IIT_KANPUR ...Expecting more videos . U r doing a great job . NOBEL PRIZE FOR COMPUTATION bczz u explained in a very lucid manner.

what if there are 3 transitions .... a,b,c? then won't that make the last step confusing?? like reducing transitions from A-H?

[ 0 1 q0 { q0,q1} q1] Mam, If it is like this..then wthr we need to consider both q1 and {q0 ,q1} as new states or only {q0,q1}...?? While eliminating unwanted states

Very nice mam thank u somuch

This is great, thanks!

very nice

Ma'am what to do in step 3 when we are drawing a tarnsition table we find 2 new state instead of one new state to go to the next step

nice

Super

tq medam plz upadate for minimization of dfa problems

Well explained!

Thank u!!

amazing, thank you!

HOLY SHIIIIIIIIIIt!!!!!!! LIFE SAVER

this is TOC topic why mentioned in COMPILER DESIGN???plx tell as am from EC background

If the problem starts wit the new name transistion table? Whats the solution for it?

not effective with very number of states an example if you have 5 states you will find it difficult with this method

what happen if there are more no. of states e.g q1 to q8 ? then there we'll face so much difficulty to generate the subset.. coz there are 2pow8 combinations. i think that is not suitable method. what do u say?

Super Thku miss

Thanks a lot gal!

mam. did not make the equivalent dfa state diagram ????????

thank you so much mam...😊

Ma'am if a problem has one or more acceptance states?

Thank you so much, I'l fail if not for you :")

Thank you ma'am 🙏

10:20 You are enjoying diwal

Thank you so much

How would you represent a Trap/dead state?

After that how to draw the diagram using that coming answer..? Can u make vdo for that 😕

Thank youu 💓

can u plz do a video on conversion of nfa to dfa in lazy evaluation method?

Thankyou maam

Can u add d video of convert nfa to dfa by using lazy evaluation method

Mam is there any video of lazy evaluation method?

thank u, mam, the video was quite useful!!

thanks