Theory of Computation: Conversion of Epsilon-NFA to DFA

If the DFA doesn’t have a transition for any symbol, it can go to a dead/trap state, qD. So in the example explained in video, the following transitions can be included, instead of ϕ.
δ({ q1, q2 },a) = qD
δ({ q2 },a) = qD
δ({ q2 },b) = qD
From the state qD, all input symbols go to same state.
δ (qD, a) = qD
δ (qD, b) = qD
δ (qD, c) = qD

[@sekhar6509]

It's really so helpful for us to solve the questions at the peak time. The way you are giving the explanation is clear and crisp. Thank you so much for providing us this wonderful content.

[@pritamdebnath3384]

less than 6 hrs left for sem exam and I'm here watching this....lmao

[@TheProblemSolvers38]

Would be better if you watch it in the examination hall itself..............

[@messiisthebest]

Same

[@kartikbarmaiya5650]

Less than half an hour left for mid sem exam and I'm watching this.

[@nammkarnatakashootout3748]

For me just 2hours remaining for exam

[@sandeshrbhat24]

Last 1 he

[@rosefilmcreation5948]

I got 98/100 in toc( bca), thanks you and other yt channels for uploading videos.

[@collegematerial5348]

From where means which book you practice the question and please also tell which channel you follow
Also tell for maths 4

[@NathanLAlvares]

Scholar mare

[@daraniprasad07]

Solllleyyy😂

[@sugamnema9103]

bca bahii bca

[@abingeorge4449]

Thanks a lot miss i have my FLAT exam in about 3 days and our teacher made this shit so much harder than it should be.

[@PROGAMING-hf4ob]

many explanations in the youtube where really complicated and hard to remember but the table method you introduced in this tutorial was damn easy and is easilty rememberedd thankyou for mam for making this so easy

[@Sweety40500]

Yes it's easy, but konni videos lo verela undhi ee mathod, ye method follow avvalo teliyatledu

[@ShubhVerse31]

I want to clear sem exam exam is starting by Tuesday please prayer for me i pass all subject😢😢😢

[@mallikarjunavb-gi2hi]

Me too bro...

[@ShubhVerse31]

@@mallikarjunavb-gi2hi best of luck my good wishes with you

[@wilxer5878]

U definitely fail good luck

[@ShubhVerse31]

@@wilxer5878 why r uh telling like this ??

[@sahilgaonkar1099]

Ma'am video was very helpful...
But one point is "In DFA there should be a transition for EVERY input character"
So You must have shown that using a dead/trap state

[@vibhu613]

Yes... I think so

[@rishmtechzz9890]

Yaah we have to add Dead state when there is Phi in above DFA table

[@rahem027]

If there is no transition, it is assumed the input is rejected there. There is no transition for every character in any FA afaik

[@kainaatmakhani6550]

You are saying right. In the "DFA" transition diagram dead state is missing.

[@omdeep4137]

Thankyou mam, this video made me Confident for such numericals

[@omkhanapure5360]

this lec solved every doubts i had in epsilon nfa to dfa Thank you so much

[@yushmmgamer6867]

Very honest and precise explanation,
Thanks

[@ankkol2011]

Thanks a lot for this clear explainations.
I was really looking very badly for a suitable example for epsilon NFA to DFA conversion.
And finally found it. 💖💖

[@archanans9920]

Tqsm for clear explanation ❤

[@maanyamuthamma3577]

Ma'am you're truly a blessing

[@syed-muhammad-ali-raza]

5:22 state a value is only q0 kindly check

[@itsoknottobeok9381]

Epsilon closure( union of (q0,a), (q1,a), (q2,a) ) gives {q0, q1, q2}

[@preethammm4660]

🎉 Ma'am this video is life saving before exam 😊

[@Bhuvan-gj7pe]

Thanks a lot mam, i have my exams in an hour will get 10marks because of you :)

[@erfanpanahi7894]

Thank you so much, it was really great

[@blaze117]

This is fundamentally wrong. You are just converting e-NFA to NFA. in DFA each state must have transitions equal to the number of inputs.
I got so confused just because of this video

[@onsyedes213]

same question here !! if i"ll add dead states, will it be a DFA ¿¿

[@Shivaramkarri]

yes, there is no definition for the transition of state b on input of a, and transition of state c on input of a and b!?

[@fahaankhan9983]

but in DFA we have make transition for every symbol on each state....

[@bhanupratapshishodia3027]

Thanks mam you are teaching awesom every student cal easily learn keet up mam

[@Rahul-ki1bh]

Thank you for giving such good explanation ❤ it really save my many hours ❤🎉

[@xipingpungi2936]

Less than 12 hours left and i am watching😅

[@rjhgworrioar9753]

Ended with easy one example not even entered intermediate problem also ,But any how you have explained well ,appreciated for that

[@yashwanthbl8946]

Thank you ma'am.
Easy to understand!🙏

[@fearlessff6453]

ghantaa

[@bandarurohitha572]

Best video for understanding this concept simply

[@SnehaWickramarathneDissanayake]

Very Good up to the point of NOT including the Dead State for the null transitions

[@shwetathakare1556]

Clearly understood the concept thank you ❤

[@deviprasadgm]

Excellent teaching....thank you mam

[@NameNotFound934]

Many people comment here to add "dead state". But dead/trap state is not mandatory to add for 'phi'.

[@oppranto]

What will happen if i got two e-closure for One input like. For "a" i got q1,q2 e-closure. Then what will happen?

[@wednesdayaddams718]

She is not a robot to answer machine like questions ask politely

[@0pini0n21]

How can a dfa have no transition for some symbols ??

[@shrinidhijag_films]

Thanks you ma'am this made my life peaceful 🥰

[@CodewithAshwani]

Easy to understand with no doubts.thank you mam.

[@jorelletuyor]

Thank you mam for making us understand more with this tutorial.Thank you and God bless you always.❤😇

[@mrjigglybell]

mam DFA always consists one way for each input symbol from every state , then why you don't make path for another inputs like from {q1,q2} where is the transition for "a". Please explain is it you missed or it is not necessary . Although you explain very well thank you so much .

[@sarthakn4398]

This helped me a lot ❤
Thank you

[@madhumohanajv9942]

Very clear explanation ma'am,thanks a lot ♥️🙌

[@loonysimmo9586]

Thank you maam 💓 but what is that sound in 7:22 😅😅

[@Homelander_21]

Mai gali nhi de saktha! RUclips me sab log dekhte hai

[@e-k4110]

what happens when we have more than one states inside the e-closure? for example, I gotta find the e-closure of {q0,q1}, should I take the union of e-closure of q0 and q1?

[@anitar8483]

Yes. eclosure(q0) U eclosure(q1)

[@e-k4110]

@@anitar8483 thanks a lot

[@swastik4685]

Less than 2 hours for internal, and I'm watching this here

[@prachipatil5996]

Thanksss 🎉🙏

[@kprasanthkumar1815]

Very Good Explanation Madam

[@AdityaSingh-zk3fe]

This is so helpful. Thank you ma'am

[@divyeshkoli2239]

there"s a doubt a null move to itself is always present even if its not marked right then in E-nfa table you havent marked null move for q2

[@dhakshinyabg6874]

Is it possible that a DFA contains only the final state

[@charanchalamasetty9427]

For Dfa all i/p should have one path know maam..here we dont have all i/p for all states.how can we call this as a DFA?

[@BirdOnBlueSky]

Thank you for your detailed explanation!

[@deepakhiremath52]

Very nice n in short explanatiin

[@nathimarygrace2973]

Mam I did the same problem by converting first epsilon nfa to nfa and then nfa to dfa....but I got different answer? Can you help me to solve this issue

[@abhivish2017]

Very well explained ma'am

[@JohnSmith-xg5wh]

I believe for a DFA must have an exiting transition arrow for every symbol in its alphabet but good video

[@ZeeshanKhan-zf9os]

Yes u r right bro

[@ZeeshanKhan-zf9os]

We should take a dead state

[@i__sandesh]

This is epsilon nfa to without epsilon nfa, but not a dfa, since all of the alphabets are not used in each states.

[@Debasish-yn6nj]

but in dfa there should be transition for every input in a state

[@UpYourHand]

Guys please read the description ma'am has mentioned the dead state...🙂

[@togya4]

girl your are the best

[@redcodes2354]

Mam do we need to draw the transitions for ɸ also in DFA?

[@sujithnarayan5335]

could you please teach in detail so that people can understand the calculations in dfa, i cant understand that. the q0 union pi, etc are unable understand.please teach properly

[@snehaljadhav4080]

thank you mam, very easily explained

[@aayushbajpai3793]

Less than 6 hrs left to declare my Sem result....and I'm watching this video...lmao

[@av76475]

this was great, saved me a lot of time, thank you

[@haidarmohammad8510]

very cool stuffs

[@bruh_5555]

amazing video maam

[@Sinchan_kundu]

thank you very much maam very helpful

[@baboucarrgibba9336]

great explanation

[@varunjojare]

thank you!! Finally understood

[@S-GauravGhanekar]

i have a doubt if {q2 a}= null but in dfa we can give null right? then a should go on deadth state?

[@piotrlezanski5156]

What, in DFA it is impossible, that from one state, you don't know where to go after some symbol. For example in your last DFA, from state B you have to go somewhere after symbol a, if it is not included, it is not a DFA...

[@ayyappareddy4461]

Awesomeeee explaination madammm

[@mayankpathak07]

Less than 9 hours remaining for sessional exam and i am watching this

[@virral-ness2280]

Less than 1 hour left from exam, agar ye paper me aya to maja aayega pure marks ☺

[@mrak1248]

Mam is there possible 'pi' in DFA
Why didn't use dead state

[@kalgikansara7369]

Do I need to write formula explaination for all ...or tables are ok??

[@madasuumamahes45]

SUPER EXPLANATION MAM TO UNDERSTAND😇

[@ZynoxOfficial007]

But dfa must use all the output(a,b,c) symbol,here B,C don't use all output symbol

[@nikhielsingh748]

This is completely incorrect. When you get an E-transition, you follow it, until you can't follow it anymore and you include the state itself.

[@NAMRATAPRASAD-g7k]

thankyou mam, nice explanation

[@nagamani7644]

Construct NFA with E which accepts a language Consisting the strings of any numb of o's followed by any number of 1'sfollowed by any number 2's, Also convert into witn E hansition. Explain this pbm mam

[@santhisri9129]

Mam if there is no input symbols then what were we do

[@nithin1729s]

but isnt that a NFA at the end ???

[@Rolex-m8l]

2 hours before sem exam watching this....🙃🫣

[@statusgallery9126]

Same

[@Updeus]

you forgot the transitions to the dead state for the DFA

[@okaudi]

I lost in the DFA first state {q0,q1,q2}a -> {q0,q1,q2}, Can anyone explain that why ?

[@surya4575]

self looping

[@poorniman7726]

Supr mam ....understood clearly.

[@Pikachu77504]

Thnx a lot mam..it's really helpful

[@Samaraa1222]

Where are the trap sttaes ma'am

[@prajakthapprabhu6103]

Mam plz Focus the paper properly...it keeps getting blurry

[@akulavarshith6379]

Mam how to find the union i we have q1,q2

[@kalpeshm9852]

Thank you mam ☺️ clearly explained

[@nazilaoudi9411]

Amazing 🎉

[@itsoknottobeok9381]

Thank you 👏

[@sohamshinde1258]

Thankyou so much ra : )

[@jayakavya29]

Nice explanation mam 👏🏻

[@wednesdayaddams718]

Thanks a lot mam it saved me

[@blakemosley4796]

isnt one of the rules for a dfa that each state must have a transition for every symbol? B has no transition for a. C has no transition for either a or b. This wouldn't be a DFA.

[@swordlion294]

The best explanation, period.

[@jacknicholas1564]

Usumularsey in the background 🔥

[@prithvirajsainiranjan6240]

Guys in place of phi put (qt) and keep it as dead state

[@xyz-qz2ob]

There should be square brackets not curly braces in DFA table

[@relmimaryk.j.368]

So there is no need to mark phi as qtrap in dfa?

[@madhavsharma9881]

you have not make a final sign in A B C