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

[@spongebobsquarepants6935]

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.

[@syedfaqruddin5768]

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

[@s_wrdk]

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

[@matttantony4077]

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

[@NirmalRajTHE-ARN-HACKER]

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

[@wangcecilia2480]

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

[@architadesai7876]

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

[@kavisalem7528]

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

[@mohammadshahnawaz2948]

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

[@h.reddylohith2000]

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

[@jothekrishnan1691]

Your videos are gold..😭❤️

[@thefuntech2810]

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

[@anirudhreddy9005]

very melody

[@potatorufus5284]

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

[@animisharao3281]

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

[@Saha121-h6y]

Super clean and understandable lecturers thank you madam

[@boringblobking3783]

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

[@abugslife2461]

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

[@shriyarajmalpe]

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

[@bodylone9076]

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

[@DATLAVAMSEESWARAREDDY]

Your explanation was very clear ma'am

[@NaveenKumarErroju]

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

[@nrupatunga5951]

Learnt a lot from your video. Thank you

[@katerinatzouma8198]

thank you for the explanation! very good! Congrats!

[@natashachetannanda4844]

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

[@ericapple2408]

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

[@samsricatjaidee405]

Thank you from Thailand.

[@nishithperla1927]

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

[@bishalale2817]

Great explanation ma'am 😊

[@vanessameow1902]

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?

[@darshanbajgain]

wow what a simple & clear explaination

[@vikasni95]

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

[@sroshan8121]

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

[@nicolasanson7459]

Very well explained, thank you so much!!

[@AbdulWahab-qc4pr]

Ohhh thanks

[@அறிவைப்பகிர்]

Thanks for the good teaching.

[@newbiehype]

Conplexxx , 😱. There is a easy method.

[@PoojaPatil-xj7vv]

Veryyy niceee ND clearly understand video really God bless u

[@mtrg1593]

omg you have mind blown me, thank you very much

[@abuusaid5640]

Faith in humanity restored .Thank you ma'am

[@johnspeny5215]

Thank you so much for making me understand

[@ahmetaltunoluk9486]

Great explanation, thanks a lot!

[@anthonykupecz3532]

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

[@anandk3610]

Osm explain mam super

[@shivaaatyagi8396]

Awesome explanation ma'am...

[@alemayehugirmawoldemariam2253]

You are very good!

[@ezhilvathani4669]

great explanation mam..thank you

[@AKHILDS-j3v]

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

[@avhaseeb]

മലയാളി :)

[@rakshithsmdeptodcse4618]

Thank You Mam very helpful

[@sudipsen6376]

Nice explanation

[@Lakshhmii]

Thank u so much mam..it is really helpful

[@arabic_data_podcast]

thank you :D saved my homework

[@vishalgandhi9242]

Thank You it will help me in Compiler Design

[@umeshtaily4602]

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

[@Aravind2803]

This was too helpful.

[@reannuemmanuelinstrella8171]

This is great, thanks!

[@shruthilaya4844]

Thanks for your nice explanation

[@crazyboykrish2673]

Excellent madam

[@kalgikansara7369]

You got a subscriber

[@squirrelgaming4028]

thank you that was amazing

[@kirankumar-ki3ci]

Excellent explanation.

[@emadmahmoud7168]

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

[@akshamj9725]

[ 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

[@natashachetannanda4844]

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

[@myfavvorite2060]

GOOD Question.

[@myfavvorite2060]

If you know the answer please comment here...im having exam this week

[@ojxchaos]

Great explanation thank you

[@coolfande5692]

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

[@SafarPeChalen]

IIT KANPUR ?

[@nanamongjam9951]

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

[@haroonahmad2374]

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

[@NitinKumar-hk8hl]

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

[@ashishhiwale6482]

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

[@abinashbehuria880]

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

[@AngelofVerdant]

HOLY SHIIIIIIIIIIt!!!!!!! LIFE SAVER

[@ziyamaslam2728]

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?

[@deebakannan]

Yah you are correct. That's the drawback of this method. In this case we can proceed with lazy method of conversation.

[@manjunathpatil7056]

tq medam plz upadate for minimization of dfa problems

[@divyagopi9882]

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

[@gauravhira008]

Thank youu 💓

[@saulhernandez8810]

amazing, thank you!

[@AmeniMh]

Thank u!!

[@AbdulWahab-qc4pr]

Its ok

[@FootyPick]

10:20 You are enjoying diwal

[@neetayadav3775]

Thanxs maam can u upload more video on construction of naf

[@manjunathpatil7056]

well understanding

[@i_cover781]

How would you represent a Trap/dead state?

[@rktunes3120]

thank you so much mam...😊

[@ashwin_Naik.Cinematics]

very nice

[@huseyinkizil4669]

Well explained!

[@akshatdhiman8819]

Thanks a lot gal!

[@tamizhavizhithirutv5497]

Super

[@PoojaPatil-xj7vv]

Very nice mam thank u somuch

[@gd7474]

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

[@chaithrapraj]

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

[@akashshrestha01]

Nice

[@kirankumar-ki3ci]

Mam is there any video of lazy evaluation method?

[@surajmandal7438]

Thank you ma'am 🙏

[@anirudhramasami]

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

[@faizaomer5737]

Thank you so much

[@acharyaphotography6855]

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

[@phoenix_picaso929]

Super
Thku miss

[@bjay6307]

nice

[@MegaBdboy]

Does this work for any NFA to DFA ?

[@karthiks9438]

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

[@meghana6142]

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

[@souravjyoti9721]

why q2 is the final state please explain once again?