Thank you so much! I had watched a lot of videos on e-nfa to dfa conversations, but your video is the best! Such simple explanation, it was very easy to understand.
I like your work! I've just one question. Why do we need to get the epsilon closure for all the states since we only use the first one? . I mean we could get the first epsilon closure of the start state and then move directly to the translation table.
I got the answer. The method she uses in the video is 100% correct. We need all the epsilon closures because every time we move to a new state according to some production we don't move to this state only but also to it and the epsilon closures of it collected together in one state in the DFA
Hello, great video :) But can I ask you what if in a state that has a loop to itself, for example the value 1, and a epsilon path to the next node. When we draw the transition table, in column value 1, will that loop be counted ? Because we can take the the loop and continue to the next node by epsilon path.
Hello, So your final DFA included 3 states: {1,2,6} , {3,4} , and {2,5,6}. {1,2,6} was retrieved from taking e-close(1). {3,4} is identical to e-close(3). {2,5,6} is identical to e-close(5). But what about e-close(2), e-close(4), and e-close(6)? Home come the final DFA doesn't have {2} {4} and {6} states?
actually, if [1] was part of the states, it should be accpted as a final state,even without [6],since you can get to the finak state with just epsilon from 1
Video is good mam..but at last while drawing transition diagram when it takes 0 you draw at dead state just minor mistake mam...but video is good and useful to me
while drawing the nfa you interchanged the 0&1 transistion for[1,2,6].Thanx for such an amazing tutorial
I thought i was having a stroke. Thanks for the clarification!
Thank you so much! I had watched a lot of videos on e-nfa to dfa conversations, but your video is the best! Such simple explanation, it was very easy to understand.
Thank you so much ... But seems there was a mix up, {1,2,6} on Input 1 goes to {3,4} and not on input 0
Thank for this video, this was sooo helpful. I truly appreciate it.
I love your teaching style.
Finally got the correct solution because of this video and it was easier than the other methods on CZcams.
Is e-closure just like the orbit of an element in a permutation group?
thank you a lot ive an exam and u just saved me :D
what if there's input 0->3->0->3 or 0->3->3->0? should we include everything for the 0 input table?
+Mifta Sintaha How do I draw (a/b)*a in NFA?
I appreciate your way of explanation.
My teacher taught it so complicated... U made it like child's play thanks :) btw u got really sweet voice
thank you , that was very nice explanation. You made my day.
Best and only good tutorial that I can understand clearly
This was the only understandable lecture thank you so much!!
thankyou so much.All your videos help me a lot during my exams.Please put up more videos related to the subjects in information technology. :)
If starting state doesn't has e- closure means ?
great work author. you saved me!
Whats the point of finding all the e-closure states if we are only going to use the first one? The e-closure of 2,4, and 6 were not used?
Why we calculate epsilan closer of all state
read on the last night of exam and saved myself thanx alot
0 and 1 interchange at state [126]
yes they were... I think it was an unintentional mistake
what was the mistake ?
on the state [126] the 0 should go to the dead state and thw 1 should go to [3,4] its a typo .You just need to switch them around.
It is understood 😁
At 11:16 correct, thanks
Great ! Short and clear!!
Thank you very much , so much helpful
i love you
please what the name of the software you are using for explaining ?
It was a really awesome video... very Helpful..!
Mam , just coz of you , i got the concept !
[I NEED YOUR REPLY]
How to choose a final state ???
Thank You..
thank you, best video on this.
Thank you very much for helping me!
thank you very much.. helped a lot for my exams..
transition from null state on 0,1 is missing ......a self loop on 0,1makes it dfa......and 0,1 are interchanged for state [126]
you saved my semester. thanks
thank you.... :)
It's very helpful for my exams
I like your work! I've just one question. Why do we need to get the epsilon closure for all the states since we only use the first one? . I mean we could get the first epsilon closure of the start state and then move directly to the translation table.
i have the same question :D
same question.anyone reply please
I got the answer. The method she uses in the video is 100% correct. We need all the epsilon closures because every time we move to a new state according to some production we don't move to this state only but also to it and the epsilon closures of it collected together in one state in the DFA
So suppose we produced (through the transition table) a state that was not listed in any of the e-closures of 1-6. What happens now?
that can never happen PHLY
Best video on e nfa to dfa
Great video and explanation.
Hello, great video :) But can I ask you what if in a state that has a loop to itself, for example the value 1, and a epsilon path to the next node. When we draw the transition table, in column value 1, will that loop be counted ? Because we can take the the loop and continue to the next node by epsilon path.
Same doubt for me too yar. If u know please tell me.
@@smile-tk7yt same doubt 😣
thankyou, it so helpful:)
NICELY EXPLAIN!! THANKS
Well explained, thank you...
thanx mam..........very useful........... :)
especially for my mid term exam
video was very helpful :)
Awesomely done ..
best explanation ever
love the tutorial..thanks❤
great video.. thank you so much
I think there is a mistake on 126
why do u consider the epsilon transition from 3 to 4 during the table?
Mira Guru XD 😈
Dead state should also loop itself when read 0 or 1. Nice job thx
Thanks great video.
thank you, great video
thank you so much. from India
Hello,
So your final DFA included 3 states: {1,2,6} , {3,4} , and {2,5,6}.
{1,2,6} was retrieved from taking e-close(1).
{3,4} is identical to e-close(3).
{2,5,6} is identical to e-close(5).
But what about e-close(2), e-close(4), and e-close(6)?
Home come the final DFA doesn't have {2} {4} and {6} states?
unreachable states ....
It is my doubt also
thx a lot...grate work
thank you very much 😍
Thanks for this tutorial
Thank you
Thanks!
A very much thank u.
There's difference between transition diagram and DFA,
very well explained
actually, if [1] was part of the states, it should be accpted as a final state,even without [6],since you can get to the finak state with just epsilon from 1
Awesome 👍🏽
Thank you !!!
What is the purpose of computing all e-closures? Wouldn't it be enough to only calculate e-closure(1)?
Yes that's enough. Take the others as a practice if you intended to.
Awsome
Thanks I understand the steps
Thanks a lot :)))))
thank you
Thanks
thankyou alot.
this more useful but there is a mistake in last step of creating the transition diagram
thnx it helped :)
e closer 2 goes to state 3 and e closer 4 goes to state 5, but why you didn't write it??
hey mifta
i was about to tell you to post videos related to automata and there you are :P
kindly add context free grammar too asap!
Thank you mam
thanks a lot
Thnks!!
आप अद्भुत हैं
good explanation of this topic compare😄😄😄 to other youtubers
I think states [1,2,6 ] and [2,5,6] are equal you don't have to write state 2,5,6.(thank you so much amazing video)
[2,5,6] there's a unintentional mistake just have to interchange 0 and 1
you have done one mistake here that is from state 126 it goes empty state by transition 0 state 34 it goes by 1
I think 0 and 1 are different places
Thank yoy
in making DFA you interchanged 0 and 1
Instead of 1 ,0 goes to fi and 1 goes to [3,4].
thank you so much!
DFA cannot have a (phi) state or null state .. it can only have a dead or trap state. How come ur DFA has a null state?
SAKSHAM MISHRA phi is the dead/trap state
Thank you so much for the video. Just a slight mistake in the first state transisition but rest of the explanation is all good. Thanks once again
Just a bit mistake as I observed, however it is a great tutorial.Thanks!
At some point you call the empty state "phi" (Φ), but the symbol for an empty set is null (∅)
Timothy Harrelson if u have to use null u have to use brackets... other phi is a correct notation and there is no mistake
Timothy Harrelson otherwise*
O & 1 transitions got interchanged for [126], otherwise quite simple explanation. Well done!!
Video is good mam..but at last while drawing transition diagram when it takes 0 you draw at dead state just minor mistake mam...but video is good and useful to me
thanks so much ; ]
in this u commited error in the drawing of dfa diagram... as the input state takes 1 as input ikt reaches 3,4 ..... but u mentioned as phi
NALLA VALIP
You have done a small mistake in DFA (11:09 - 11:17). But it doesnt matter, Teaching was superb.
what is the mistake you dumb fuck tell us
nice video but low audio