Conversion of Epsilon NFA to NFA - Examples (Part 1)

[@bhekeruchi1221]

When you don't have books ! during lock down its really very helpful .! Thankyou sir!

[@aietisreekar2425]

Sir your teaching is amazing. Thank you sir.

[@gaminglovers3097]

Ur my life saver. Love all ur lectures ❤❤❤

[@rahuljaswal9270]

life saver even after so many years

[@swatiagrawal7837]

Thank uh so much Sir for such use full video....all videos are very helpful for me.......again a big thank uh sir..........

[@Aulin001]

You are a life saver for us😇

[@jertlok]

Thank you very much for your lectures, i have found them very useful.

[@afraimlevi9871]

may G-d Bless you bro , such an Amazing Way of teach , keep it up , and do more

[@ayushgupta348]

*last minute exam preparation when you don't know anything*

[@aquibiqbal7831]

hey, what you are upto now?

[@saadmanahmed860]

good elucidation

[@mohammadamaanzahid2399]

Is the final state just D in solution? B and C should also be final states as they can reach to D as shown in transition table. Please clarify if wrong.

[@poonamSharma-pd6tu]

He said final stage is that which can be reached by using É( epsilon) only so in this question we can go from b to c only using epsilon hence d is only final state ( I understand this from the lecture hope it will help uhh :)

[@shivangiteotia8284]

Yes B and C are also final states , as it hai route to D alsoo

[@dblade841]

why didn't we have multiple final states this time?

[@pcgames6109]

at minute 1:04 , when you read A with Epsilon, how does A goes to itself if there is no loop like on state B? and there is no Epsilon sign in between A and B..

[@yeslimshady]

we don't write epsilon for self loop. and also u can see how can we reach to A from A state? using nothing right, this nothing is called as epsilon.

[@shivangsrivastava4522]

every state on epsilon goes to itself. watch video of epsilon NFA to clarify basics.

[@shahtanmay902]

Sir, can we write 0,1 where for both inputs current state is going to the same next state, instead of the drawing parallel arrows?

[@anuragdutta7820]

Yes ofc.

[@yosh6458]

thank you nesoooooooooooo

[@kalyannagri5714]

U completely changed the technique for this problem .. compare to previous problm....nobody identified

[@lohithnnegalur2018]

when B gets input 1 it can reach B,C and not D am I right ??

[@sakshamgupta8736]

I have the same doubt.

[@bharathroshan2416]

@@sakshamgupta8736 i think @NEON MUSIC is right....D shouldn't come when B gets 1 as input.

[@shivansh-gup]

same doubt

[@nischalshakya2015]

Yeah B cannot reach D on getting 1. It can only go to B and C

[@ClivinJohnGejuBCE]

The epsilon closure of B is B and C, so you have to consider for both the states when you see where they can go for input *1*. For B, it can go to B and C, and for C, it can go to D. That's why you can see the states B, C, D mentioned there. I hope you guys got it now...

[@__looser__5204]

i am seeing this at morning 5 30 and myvexam is at 9 i am sure i will get outoff for this question thanks sir

[@eodico]

how'd you do?

[@ankitchaudhary6142]

Sir, I believe a tiny thing is missed in the end, that B and C states shall be marked with double circle in the diagram (i.e. final states) coz. they also lead to the final state D without requiring any input. Is that correct??? Kindly reply please, great content tho

[@aswinp888]

no, it is wrong because when u go from one state to another, it has to be explicitly shown by epsilon which is not in the diagram(C transitions to D only when 1 is given i/p). There is no need to put epsilon if u are going to the same state.

[@05-cs-adarshgautam16]

@@aswinp888 epsilon is also taken self if u are going to itself state i.e same state

[@AbhishekSingh-fj2so]

Tomorrow is my exam 50% done 50% still to be done......10 hrs 55 min remaning.....god help me

[@luvdipsinghdadiyala8427]

How was your exam Abhishek bhai ???

[@rabiaabid7559]

how to find regulae expression of e-nfa??

[@omkarsuralkar8099]

Thank You♥

[@suganyadurai3607]

I have a doubt sir why don't we choose b and c as final state.. B,C,D are the final state here..

[@s......g....4415]

B isn't the final state because it would reach state C using Epsilon and C is not a final state...................a state has to reach the final state through Epsilon in order to become a final state itself in the Regular NFA

[@slmanhm6339]

Thanks

[@ktdpt3073]

why state B is not a final state? please ans me

[@s......g....4415]

B isn't the final state because it would reach state C using Epsilon and C is not a final state...................a state has to reach the final state through Epsilon in order to become a final state itself in the Regular NFA

[@arjunthecomic7278]

God help those in the comment section.

[@AkumaNoKuma]

lol god will pass me

[@dequeue3301]

Is this the same as lambda transition or is that different? The methods are different for lambda transition.

[@mdmotasimbillah-s3y]

Sir, may be you made a mistake here in this video in the NFA drawing as well. i think the c state should be also the final state as well as d state sir,

[@JiyaSolanki-y3m]

how to check for initial states? means can we have 2 initial states?

[@yeslimshady]

no, having multiple initial states would create ambiguity. initial state is the state from which the automaton starts processing the input string. (usually a arrow is shown at initial state)

[@MayankSharma-cp6yu]

If state b gives d on 1 as an input then why we don't made b as a final state since d is also a final state?

[@swatiagrawal7837]

only those states will be final state which can go to final state by seeing epsilon....

[@RohitChauhan-fx6qv]

Sir is there any process to convert epsilon NFA to DFA. Sir please make a video on it.

[@dhanushsivajaya1356]

Thankyou sir

[@ridwannana-yawamoako2939]

what is the main difference in converting eNFA--->NFA and also converting eNFA-----DFA because the process appears the same. My understanding is that it in the first case the states for eNFA is the same as NFA but when converting to DFA the states are combined. Pls correct me if Im worng. Further explanation will be appreciated. Thanks

[@ChristianBurnsShafer]

??? Main difference is one converts the eNFA to a non-deterministic machine and the other converts it to a deterministic machine ... and the process isn't the same ....

[@yeslimshady]

the e-NFA to NFA conversion focuses on eliminating e-transitions, while the e-NFA to DFA conversion aims to capture the non-deterministic behavior of the e-NFA by creating a deterministic equivalent

[@mridulanand10]

why can't A go to final state D? CAN ANYBODY HELP

[@palladiummusic2703]

its because epsilon is till just between B and C if there would’ve been an epsilon between C and D then we could’ve gone till D

[@letmeout4]

I think b on input 0 should enter dead state else the construction of DFA from this NFA will not perfrom same.

[@adilbimzagh5453]

there is no death state in NFA

[@letmeout4]

@@adilbimzagh5453 let us assume this will be converted in Dfa from this nfa.

[@adilbimzagh5453]

@@letmeout4 yeah and where is the problem ?

[@tejaltatiwar4682]

Nh smja

[@mrkmed7050]

i didn't understand why B and C aren't final states

[@dblade841]

did u get ur answer?

[@gardenscapeslover7012]

Since b and c does not have d as part of its epsilon closure, they can not be final states.