one ofmy university teacher was watching the TOC lectures by NESO academy. she could solve the questions butfailed to explain us the same topics she studied a while ago. I mean,the conditions of a few college teachers is really bad, and pathetic. thank you Neso academy for saving the lives of thousands of students. Mad respect for the neso academy teachers!!
I appreciate the simplicity and explanation of small things, I only wish the institute which I pay dearly for would try such an approach instead of just being smug and saying how smart they are while not teaching us.
Thanku for making this amazing videos on automata. It's help me a lot. Initially I have little bit confused from where it can study automata I have even buy so much books but nothing get help but as I have seen this tutorial it can get help me a lot thanks 🙏🙏
sir im not even kidding i will bow down to your feet and do a namskar with my head. you are a legendar teacher sir. i had failed in this TOC twice sir, everytime i asked i profesor for notes or how to study this subject they always told that study from the reference book but you know that the reference book as scary as a real ghost. i think i found neso acamedy a little late but anyways finaly i found it and im understanding concepts crystal clear. shat shat naman hai guruji aapko.
5:200 In the last video you mentioned that for completion of DFA for each state we have to give some input... Suppose here in this example is it necessary to give= A takes input ->0,1 & goes to A, same for state B, then & only then it's complete DFA?
You cannot self loop at C because it would be contradictory. C is the final state but looping again means you add another symbol, which would exceed the required length of 2. When you exceed that required length it means it would be invalid, which would not be possible as C is the final state. (Final state cannot be invalid).
As per I know, adding a self loop will add one more input symbol which is going to break the constraint of length 2 So you can't self loop and have to move to the rejected state
the purpose is to eliminate any strings above two to dead state so a self loop on c would not send it to dead state but to final state meaning the you want any 10 combination of infinite length
If we self loop state C the string length becomes 3 and it also accepts the string of length 3 as C is the final state.which is contrary to the given question.
Yes, if dead state isn't present your machine would simply truncate the remaining inputs . For eg: if the input is 000 or 001( these are strings of length 3 ,and hence should be rejected by the machine, but if the dfa doesn't have a dead end every input would simply stay in the final state at the end thereby accepting all string values and our designed dfa will be wrong ) . I just hope you understand whatever I tried to explain.
I dint understand one thing !! Is it compulsory to mention Dead state for all DFA problems ... my teacher he dint gave dead state for some problems ... is it optional ..or its mistake if we dont mention it ..
If it C has a self loop an input of 3 alphabets will be accepted because the third input would end at C and C is an accept state. He extended the diagram to have a 4th state D so as that the third input can end in a dead state(D), understood?
because we are to construct a dfa that accepts sets of all strings over the length of "2" making c loop means sets larger than 2 would be accepted because they will then be in the final state
one ofmy university teacher was watching the TOC lectures by NESO academy. she could solve the questions butfailed to explain us the same topics she studied a while ago. I mean,the conditions of a few college teachers is really bad, and pathetic.
thank you Neso academy for saving the lives of thousands of students. Mad respect for the neso academy teachers!!
wouldn't fly in america
These video lectures is great when you really don't know where to start with.
Explanation of the guy is amazing.
I appreciate the simplicity and explanation of small things, I only wish the institute which I pay dearly for would try such an approach instead of just being smug and saying how smart they are while not teaching us.
lol
Literally commented the words in the minds of everyone who came to Neso Academy YT channel as a last ray of hope.
I can't compare this class with my teacher...Because they teaching the whole thing in a pure disaster manner..
Your class is precious to me..❤
Finally I have started to understand automata.. Thank u sir
Thank you so much. I have exam tomorrow and i skipped lectures. You are amazing ❤
So how was the exam?
Even though I have not entered the class for this I now hv a good knowledge of this.
Your way of explanation is so good sir
Why these videos keep explaining so amazing while our teacher is teaching like sh*t?? 😃😃😍
Asking myself the same question.
Here we are going to listen before exam in class we listen with a sleepy mood
I am surprised
Exactly
Because you are paying to your teacher.
loved how you explained it in such simple way
easy to take in
well, Thanks so much sir for your efforts .. simple, direct and easy to deliver the idea of the question and how to solve it..
How can people dislike this video?!
Those are college teachers, lol
@@gamar1226 lmao 🤣
Very good explanation, I really appreciate that :)
Thanks for making this videos :)
Fantastic, very useful. Thank you so much.
I have a mid-exam in the afternoon. Your teaching style is a piece of cake.
Really helpful man, been to so many lectures and can never understand but your videos are much more helpful in understanding. Thanks
Thanku for making this amazing videos on automata. It's help me a lot. Initially I have little bit confused from where it can study automata I have even buy so much books but nothing get help but as I have seen this tutorial it can get help me a lot thanks 🙏🙏
sir im not even kidding i will bow down to your feet and do a namskar with my head. you are a legendar teacher sir. i had failed in this TOC twice sir, everytime i asked i profesor for notes or how to study this subject they always told that study from the reference book but you know that the reference book as scary as a real ghost. i think i found neso acamedy a little late but anyways finaly i found it and im understanding concepts crystal clear.
shat shat naman hai guruji aapko.
Thank you sir. You are teaching us in very nice way. Thank you so much.
you're a great teacher, thank you so much for this !
Prime minister Modi is going to call you out
Keep up the good work.
10000000 times better than my course teacher.
finally understood automata ,thank you very much🙇♀🙇♀🙇♀🙇♀
Awesome videos, loving the playlist
I freaken love you and this channel for this content!
May you live a long prosperous life!
thank you so much completely upset how I found your channel after my exam --;
Thanks a lot, man! Great examples and great explanation!
thankyou so much please complete the COMPILER DESIGN COA CN
tutorial and DBMS as soon as possible
very impressive,explanation is so clear this videos are so useful at exam point of view thanks !!
5:200 In the last video you mentioned that for completion of DFA for each state we have to give some input...
Suppose here in this example is it necessary to give= A takes input ->0,1 & goes to A, same for state B, then & only then it's complete DFA?
Wow you really helped me understand it better> Thank you very much.
sir love you and appreciate all your efforts,,,best wishes from bangladesh
You are a great teacher ✌️
But why we can't take a self looo on state C, as we complete the length 2 of the string?
You cannot self loop at C because it would be contradictory. C is the final state but looping again means you add another symbol, which would exceed the required length of 2. When you exceed that required length it means it would be invalid, which would not be possible as C is the final state. (Final state cannot be invalid).
As per I know, adding a self loop will add one more input symbol which is going to break the constraint of length 2
So you can't self loop and have to move to the rejected state
Sir your teaching is really good
❤Well explained.. Thank you very much..😊🔥🔥🔥👍
nice explaination
Really good explanation
Thanks for the effort
really clear examples
Good Explantion..Sir...Thanks..
good lecture
You are life saver DUDe
thank you very much
awsome way of teaching.........
Why we've drawn D ? If we let this after C, it will also satisfy question?
Thanks bro I am searching for this ....
Thank u man this was so helpful
Excellent explanation 👌💐
Can we put a self loop for b containg 0,1 and mention it as final state?
Can we?
Have you found out?
@@harshkumar7857 .
I skipped the wix ad just at the moment when he told wait before skipping ad . 😂😂😂😂😂
ty neso academy
Thank You
i have a doubt in 5:22 ..why we extended from final state c to d ? can we not just do self loop in final state itself?can someone expalain?
That would make the length of final string 3
That will make the length 3 instead of 2
Thank you so much sir
Thanks a trillion kind sir
Thnkyou for the explnation
Excellent 👍
What if we eliminate D and put the loop at State C?
the purpose is to eliminate any strings above two to dead state so a self loop on c would not send it to dead state but to final state meaning the you want any 10 combination of infinite length
so if the question wasn't limited to the length of 2, we would have made "A" self loop with 0,1 right ?
Thank you ❤
At the first example why didn't we loop 0,1 at the final state C instead of going to the dead state
Because in that case length of string will become 3 but we need 2 as mentioned in question
Why can't we give s self loop to state C and finish it there. Whats the point of making another state D? at 5:10
If we self loop state C the string length becomes 3 and it also accepts the string of length 3 as C is the final state.which is contrary to the given question.
Nice lecture
Sir also provide practice questions with solutions or just answer if possible. Thank you so much 🖋️📖📚📚📚
Thankyou !!
really, fantastic and dynamic videos.very helpful
Explaination is realy good....
It was very much useful
1000x better than my lecturer
Thank you so muc
Sir you are amazing!..plzz make videos on python,compiler design,design and analysis of algorithm sir✨✨
thx
My teacher 😎
why aren't we adding a self loop in state C ?
Thanks
Is it necessary to draw dead state to every DFA?
Yes, if dead state isn't present your machine would simply truncate the remaining inputs . For eg: if the input is 000 or 001( these are strings of length 3 ,and hence should be rejected by the machine, but if the dfa doesn't have a dead end every input would simply stay in the final state at the end thereby accepting all string values and our designed dfa will be wrong ) . I just hope you understand whatever I tried to explain.
Love from karnataka❤❤❤❤❤❤
Thank sir
I have a doubt sir is it necessary to have 3 states or we can use self loop for B state
Ya same doubt
Bro in question they have mentioned length as 2. So it is necessary to have 3 states
If you give self loop on b so it create 1 length as well as 2 length.
We we want exactly 2 length string.
I dint understand one thing !! Is it compulsory to mention Dead state for all DFA problems ... my teacher he dint gave dead state for some problems ... is it optional ..or its mistake if we dont mention it ..
A terminal symbol is needed, perhaps Sigma = {0,1,T}
A man jumps off a 5 story building,
as he passes the 3 floor (final state) he says so far so good
Sir please tell how to know how many states we will get? How to check if the drawn diagram is correct?
To know whether the diagram is correct or not only he is checking with the string at the end
why we make state D we can again come back to state C for any input 0 or 1
why can't "c" having self loop sir. pls clarify my doubt sir pls🙏
If it C has a self loop an input of 3 alphabets will be accepted because the third input would end at C and C is an accept state. He extended the diagram to have a 4th state D so as that the third input can end in a dead state(D), understood?
@@geolegacy2 yep dude
@@geolegacy2 Thank You
@Sunaan S we can't make a self loop on B. Beacause in case of third input or many next inputs, it will accept which is not possible
It also violates the rule of having length 2, if C contains self loop.
Instead of dead state can we give self loop to state c ??
did you learn the answer??
I have one question sir...why 0,1 is taken as input after reaching state B.is it depends on the length of the string?
Me too😔
thnx for this..
Thankyou sir
Can I give self loof to state b and make it as final state
during your last example there is string of length 1 which is not a final state so tell me why it isnt a dead state.
why can't we put A to B (0,1) then from B to B self loop(0,1)?
did you learn the answer??
length 2 is mentioned in question so that's why we taken
thanks for teaching so goooood...
sir in these example if we give no input then also it goes to an different trap state
is there any way to run video on higher than 2X.
Thank you..
Is it necessary to write dead state?
why he does not stop at the final state? I think this is enough as a solution to the issue
Yes I have also doubt in this can anyone please tell me@ Neso academy
What if I give a self loop to B??
If you give a self loop to B you are allowing inputs greater than length 2 so we need 2 states A and B and a final state C
Then it occurred 1 length
@@aadarshmishra1488 i agree that we should go back to state b with a lenght of one on any input at the final state
@@bmwmaniac3 c is not final state
At 5:00 , why don't u apply the self loop on C itself ?
because we are to construct a dfa that accepts sets of all strings over the length of "2" making c loop means sets larger than 2 would be accepted because they will then be in the final state
Sir can u do construct a dfa that accepts 0 and 1's that has even no of 0's and even no of 1's
thenkyou!