Hey man! Thanks for pointing this out. I was crazily trying to go through my notes checking where was it that epsilon moves was mentioned before this video lol.
Sir thanku u so much,aaj main sirf aapke channel par sukrana karne aaya hu,meri bsc computer science degree complete ho chuki h or aapke dwara diye gye lecture se main computer me achhe marks se paas huaa hu #thanku sir luv u❤❤ or aap bhi apni life me khus or successful ho ye dua h hmari🥰🥰
ANNA BIG FAN ANNA.THERE IS NO TEACHER IN OUR COLLEGE WHO EXPLAINED ATFL IN SUCH A EASY MANNER LIKE YOU .I AM ABLE TO PASS IN MY SEM EXAM ONLY BECAUSE OF YOUR EXPLAINATIONS.THANKYOU SO MUCH ❤
hello sir....mein Kerala se hun...aapki videos dekhne ki wajah se mujhe har ek exams mein ache marks mil rahi hai . Even hamare TOC ke teacher bhi aapke channel subscribe kar chuke hai ..before 2 years..Bcz ...You are really Awesome sir....Keep going...All the best..👍👍👍👍👍👍🔥🔥🔥🔥🔥🔥🔥🔥🤩🤩🤩🤩🤩🤩🤩🤩
This method is very confusing. I tried to solve other questions but I was not able to do it. In GATE exam, this method is impractical as it will consume most of the time.
I watched so many videos bcz i couldn't find yrs in this topic , but couldn't understand a single thing there but through thisss 2/3 mins only and im ✅
Mere college mai bas teacher name ka hai.. padhana toh unko kuch aana nhi hai.. is se million times better aap ho... Very well explained sir each n every topic ✨ from your lectures now I know what is automata.. otherwise I think that it's boring subject 😩 but now it's very interesting subject thankyou so much sir 😊✨
All those are having doubt make correction : At the last moment sir forget to remove initial state symbol from q0 and as well as he forget to erase q0 and q2 as q0 is unreachable state so we can't even reach q2 as well , so So only the valid states are q1 q3 q5 q6 I hope you all got it ☺
@@vedantkarale4077 There is a rule. If S1 is initial make S2 initial (epsilon move). First, q0 is initial bt after removing epsilon, q1 would be initial. We usually start from the initial thus we remove the unwanted q0 at the end.
Sir, in NFA or DFA, we have only one initial state ( Q, q0, F, delta,. sigma). So, why is there more than one initial state?? e-NFA to NFA can be transformed with the help of epsilon closure method, there no more than one initial state is coming!!! Please reply and explain Sir.
Sir, one doubt is there... How possible more than one initial state in finite automata... Because generally only one initial state possible in finite automata..!
M damn sure our bullshit clg madam may take 1 hour irritate lecture to just teach this one simple concept. And even we cannot understand properly....We all r luckiest fo having u sir❤️.... M throwing Uncountable blessings towards u sir
On any day I will choose Varun Sir over Ravindra Babu Sir. Aap bilkul ek friend ki tarah padate ho, aisa ho hi ni skta ki kch smjh naa aaye. Unka 40 min ka video hota hai aur sab 2 baar dekhna padta hai.
Sir, i think Rule 5 is absurd because NDFA allows dead configuration... But for cleanliness, its ok... (PLEASE COMMENT SIR{hUGE fAN},I NEED THIS ANSWER.I HAVE IT IN THE CURRENT SEMESTER)...
यदि S1 से S2 non-null transition/edge E हो, और S2 से null move S1 पर जा रहा हो, तो इसका बनेगा S1 पर E self loop में, परलइसे उपरोक्त algo द्वारा कैसे करेंगे?
Can the second e-move be removed after removing the dead state in this example or we have to remove it in the end only i.e. after removing both the epsilon moves?
yes we can remove the second e-move first after removing the dead state , like both will be okay until it doesnt affect the whole process, as sir did its best that we remove dead state at last but if you want to remove it first you can
Definiation of Epsilon is on Lecture 25 of this playlist
Hey man! Thanks for pointing this out. I was crazily trying to go through my notes checking where was it that epsilon moves was mentioned before this video lol.
Also in lecture 4
brooooo
Really needed this! Thanks man!
Thankyou for the information 😊
Sir thanku u so much,aaj main sirf aapke channel par sukrana karne aaya hu,meri bsc computer science degree complete ho chuki h or aapke dwara diye gye lecture se main computer me achhe marks se paas huaa hu #thanku sir luv u❤❤ or aap bhi apni life me khus or successful ho ye dua h hmari🥰🥰
bhai this sir is god!! i am ssly thinking agar aap nahi hote to mai college mai passs kaise hota! amazing sir!!1
🤝🤝🤝
ANNA BIG FAN ANNA.THERE IS NO TEACHER IN OUR COLLEGE WHO EXPLAINED ATFL IN SUCH A EASY MANNER LIKE YOU .I AM ABLE TO PASS IN MY SEM EXAM ONLY BECAUSE OF YOUR EXPLAINATIONS.THANKYOU SO MUCH ❤
AT-FL called FL-AT in my syllabus.
varun singla respect++;
for infinity times
great way of teaching
thank you so much sir
I really couldn't imagine my life without you. Thanks a lot ❤❤
god bless you ..you are doing such a amazing job sir..we really need a teacher like you...we all truley blessed.
Dil hi le loge kya ab?
hello sir....mein Kerala se hun...aapki videos dekhne ki wajah se mujhe har ek exams mein ache marks mil rahi hai . Even hamare TOC ke teacher bhi aapke channel subscribe kar chuke hai ..before 2 years..Bcz ...You are really Awesome sir....Keep going...All the best..👍👍👍👍👍👍🔥🔥🔥🔥🔥🔥🔥🔥🤩🤩🤩🤩🤩🤩🤩🤩
This method is very confusing. I tried to solve other questions but I was not able to do it. In GATE exam, this method is impractical as it will consume most of the time.
I learned all btech sibjects from your lectures thank you sir
Thanks sir for making TOC very easy for us 🙏
I watched so many videos bcz i couldn't find yrs in this topic , but couldn't understand a single thing there but through thisss 2/3 mins only and im ✅
Sir I regularly watch ur lectures only I really learnt a lot from u sir it is very useful tq✨
Mere college mai bas teacher name ka hai.. padhana toh unko kuch aana nhi hai.. is se million times better aap ho... Very well explained sir each n every topic ✨ from your lectures now I know what is automata.. otherwise I think that it's boring subject 😩 but now it's very interesting subject thankyou so much sir 😊✨
Wao sir bhaut acha explain keratae he Aap
Thanks a lot sir, watching one day before exam ❤😂
Singla sir last video me nhi btaya aapne Epsilon move!!
Following your course from the beginning, awesome.
Thank you Sir
Sir aap acha padhate ho u clear my doubts on dfa and nfa thanks sir
thnx alot dude
thank you sir
Thank you so much sir,
amazing content
Thank Of Lots sir , For your Explanation This Topic 🤟
Thanks a lot !!! love from tamilnadu♥♥♥
ig Videos are not arranged in the order but yaa amazing work did by the sir
Nice Sir 😊
Really you are amazing mai aapke Karan pass ho payi
Great explanation sir✨👈
Thank you so much sir .. very well EXPLAINED 😊
Ap he akele teacher hai youtube per jisse pd kr energy aati h baki sb to lori sunate hn😅😢
Very Very thanks sir 🙏
When exam comes near, only your lectures are engineering student's 1st choice...
All those are having doubt make correction :
At the last moment sir forget to remove initial state symbol from q0 and as well as he forget to erase q0 and q2 as q0 is unreachable state so we can't even reach q2 as well , so
So only the valid states are q1 q3 q5 q6
I hope you all got it ☺
Thanks
Isnt q0 reachable from q2 state by giving 0
@@KB-zg8ho But we move the start symbol to q1. Now q0 and q2 are unreachable. That's why
@@pablu_7 but q0 is still the start state. So, q0 cannot be removed
@@vedantkarale4077 There is a rule. If S1 is initial make S2 initial (epsilon move). First, q0 is initial bt after removing epsilon, q1 would be initial. We usually start from the initial thus we remove the unwanted q0 at the end.
Sir ji , thank you ❤
I wish our professors would give the same effort...
I am big fan of you awesomeeee explaination sirrr
excellent explanation sir😊😊thank you so much
Sir, in NFA or DFA, we have only one initial state ( Q, q0, F, delta,. sigma). So, why is there more than one initial state??
e-NFA to NFA can be transformed with the help of epsilon closure method, there no more than one initial state is coming!!! Please reply and explain Sir.
bro do u know the answer now .. pls reply....!! im also having the same doubt
Sir, one doubt is there...
How possible more than one initial state in finite automata... Because generally only one initial state possible in finite automata..!
Thanks sir g
Best content !! Godlike
Epsilon definition is present on video no 25
M damn sure our bullshit clg madam may take 1 hour irritate lecture to just teach this one simple concept. And even we cannot understand properly....We all r luckiest fo having u sir❤️....
M throwing Uncountable blessings towards u sir
Thanks sir for lacture
Thank you so much Sir 😗😗
varun singla sir -like
ravindra babu ravula sir -comment
😜just for fun
Hahaha..Let me comment first
On any day I will choose Varun Sir over Ravindra Babu Sir. Aap bilkul ek friend ki tarah padate ho, aisa ho hi ni skta ki kch smjh naa aaye. Unka 40 min ka video hota hai aur sab 2 baar dekhna padta hai.
In NFA there should be only one initial state(as per text books).
In DFA , aslo there should be one initial state , but final state can be multiple. 🤔
i also have the same question?
here there are two intial states at the end why sir???
kya pata bbhai , same que,
@@cse-63-rishisingh75
the man I watched one day before the exam literally got 90 percent
Thankyou so much sir
Thank you for your hard work and dedication. But one thing lecture 18 should come after lecture 25 I think.
yaa exactly i was also searching for the same
thanks alot sr
Sir please make a playlist for computer graphics,php and data communications and computer network 🙏
Super video
Great explanation sir
but sir in NFA definition, multiple initial states are not possible. please explain
Bro that is dfa definition
Thank you sir!
greattttt💯💯
Thank you sir ❤️
this guys is himself a complete university
kabhi kabhi souchta hu ki college mai fees de hi kyu raha hu
padhta toh sb yaha se hu !!
Sir, if S2 is final and S1 is initial then what are we supposed to change?
Did you got the ans??
Great watching April 2024
Amazing
say if S2 has a self loop do i also connect s1 to s2 then?
love from pakistan
Sir agar last transition hi € transition hua tab kya krege???
Sir, how can there be two initial states?? The Nation wants to know!
😅
Nfa can have 2 initial states
@@tejaskale1635 where you saw 2 initial ?
Sir is there another trick for this because in my text book answers don't match !!
6:59 Remove a state which's unreachable or dead.
dead state: doesnt let you exit out
unreachable: doesnt let you enter in
Thank
I am 10000'th person who like this video.🥳
Sir solve more questions epsilon NFA to NFA conversion.
Sir, i think Rule 5 is absurd because NDFA allows dead configuration...
But for cleanliness, its ok... (PLEASE COMMENT SIR{hUGE fAN},I NEED THIS ANSWER.I HAVE IT IN THE CURRENT SEMESTER)...
love u ssirrrrrrrrrrrrrrrrrrrrrrrrrrr muaaaaaaaaaaaaaaaah
How come NFA have multiple initial state
?
nice
ty sir, but there can be only one initial
Amazon selling er upor e video banou please
Is it possible to have multiple initial states in finite automata?
Same doubt....did you find the answer to that question??
No only one initial state and can be multiple final states
sir pls also use example of gate papers in your upcoming videos gfg kay example banakay to video may bhi bana sakta hun
Sir if any state will contain self loop then what we can do suppose that if q4 will contain self loop of (0,1) then what will be?
I THINK THERE MAY BE A TRASITION BETWEEN q3 TO q4 BY '0' INPUT ...
Very nice explanation sir but what to do if their is a self loop
Introduction of E-NFA is available in 25th video of this playlist.
Sir I have doubt is it possible more than one initial states in nfa or dfa
Please reply me
Otherwise way of teaching is fabulous
Not possible
No
Can a NFA (or, DFA) have multiple initial state?
Self loop ho agar toh kya Krna hai.. previous edge pr lagega kya self loop
Sir we can't take two states as initial state
By the e closure method and your method not getting the same answer .
Sir can I create a DFA from it. I tried but it create a null transition on q2 for 1.
how 2 initial state is possible?
sir q2 is also made initial state ..then we have multiple initial states in NFA ??
यदि S1 से S2 non-null transition/edge E हो, और S2 से null move S1 पर जा रहा हो,
तो इसका बनेगा S1 पर E self loop में,
परलइसे उपरोक्त algo द्वारा कैसे करेंगे?
sir can we allow 2 initial states in an NFA ??
What if S2 has a self loop?
Dusre method se solve krne pr q4 dead state nhi aa rhi
q3 0 k liye q4 pr ja rhi h
Sir this method is not working for some problems can you please tell ? How can we post our doubt s sir , Can we post our doubts through mail.
True that even I was also wondering the same . But the trust level on sir is so high that cannot even say he is wrong
ok
Can the second e-move be removed after removing the dead state in this example or we have to remove it in the end only i.e. after removing both the epsilon moves?
yes we can remove the second e-move first after removing the dead state , like both will be okay until it doesnt affect the whole process, as sir did its best that we remove dead state at last but if you want to remove it first you can
and if you can make its transition table it will be more effective to get what u are trying to ask..
sir how can a finite automata have multiple initial states??