Well this is not a 10-20 min lecture it is 5-10 min cause i watch in 2x,i am preparing for universities exam and i always prepare a day before exam and i have successfully given my endsem of coa and nac through his playlist and have successfully attempted all questions,5/6 questions were on topic explqined by sir though questions were gate level
length of XY must be less than or equal to N. but in both examples you are taking the length greater than N. language is infinite so its not making any difference but for cases it will create a huge difference. for example : L = { a^x b^y | 1
@@sameeranerella1120 see jo n question me dia hai aur jo pumping length n hai wo dono alag alag hai. assume pumping length as N aur iski value khud se set kar sakte ho ex- take Nas 5 fir us hisaab se string choose karo ke string ki length 5 se badi ya barabar ho aur fir baki condition match karo hope this helps
My brain was getting all flustered by reading from the notes, I was trembling how to study tomorrow itself is my exam and search on UA-cam and this video popped up!! I'm really thankful sir, I've come across almost every video of yours and subscribed it...very much helpful.. THANKS TO MY NEW GURUJI
Excellent way of teaching , I spent more than an hour by watching a video and reading a book but can't understand pumping Lemma, but Undestand whole concept within 5 to 7 mins by watching ur video..
At once I thought I would never be able to get this concept but with the blessings of God, I found your video and guess what now I can solve any question on pumping lemma. Thanks a lot:):)
Ive referred many materials for the clear explanation of how pumping lemma works.. bt i dint understand. Now its a clear explanation. Thanku so much sir. Yesterday i started this series. Today ill finish it. Ive cleared net.Ill clear jrf this time with ur support sir. Thanku so much.... 🙏
Our college teacher literally took more than 1.5 hour to explain this same topic in class but still almost no student understood it. That teacher has been teaching for 10+ years in one of the best Engineering colleges of India and that is his level, Varun Sir literally took 10 minutes! Really shows the quality of our education system.
Pumping leema is like semi final match: if you win then maybe or may not you win the tournament match in final, but if you loose the match in semi final then its clear that you are not going to win in the tournament 😂😂😂😂😂
I study CS in a shitty University here in Pakistan where this course, Automata(TOC) is worse than a disease.... All thanks to Gate Smashers, we all( class of 200+) rely on you! keep it up!
Sir please please have mercy on me ......U are super super...I can bet in whole india no one can find better than you.u are lovely varun sir..Masha Allah May Allah subhanawata-alaa bless u n olwaz succeed u.m waitng for million subscribers here..N m very very sure about this.
Important to note that the pumping lemma should be used to prove a language is not regular only when that language is NON-FINITE. All finite languages are regular since they can be described by finite automata. This was confusing to me at first because you can trivially see that a finite language will not satisfy the pumping lemma
I was too worried about my exams that I would fail this subject but by listening ur Lectures I am confident of passing this subject with GOOD Marks. Thank you So much GATE SMASHERS!!THANKs, Varun SIR!!!!
Pumping lemma is one of the method to check whether the language is regular or not. finite language is always regular. hence PL is used for checking if infinite language is regular or not. PL is negative test like hypothesis testing. Failing test means Not regular. (Not the other way round)
@@vaibhavmahalle6943 In pumping lemma first we assume language is regular so their exists FA of N states which accept that language And finally we arrive at contradiction I will soon make video on that.
@@AmitKhuranaSir ye sahi kaha aapne kyunki agar arbitary n lenge to regular language bhi fail karengi. and partition kaise create hota hai and also tell me about the game which Peter linz has suggested in this topic.
we have to try to divide string s in 3 parts in all possible combination. If all 3 condition don't satisfy together then we can say it is not regular language. In the first combination 1st and 3rd both are not satisfaying.
Bs test fail krne k liye pdhna h.... kota factory m shi bola jb sure nhi to kyu pdh rhe h hum in theories ko........ BTW... sir aap bhut acha pdhate ho😊😊❤❤❤
@@balaji6466they dnt clear thi doubt sir. Because the same doubt is asked in many comments for this video since from last 1 year but no reply from his people...
sir your 10-20 min lectures are worth than 1.5hr lecture that they teach in universities. appreciated sir, keep up the good work
Indeed...
Sir explains in the best possible way..
Can't agree more with you
😂😂😂😂😂😂😂
Its true....
Do you guys even know, it is deeply related to and based on PIGEONHOLE PRINCIPLE
Well this is not a 10-20 min lecture it is 5-10 min cause i watch in 2x,i am preparing for universities exam and i always prepare a day before exam and i have successfully given my endsem of coa and nac through his playlist and have successfully attempted all questions,5/6 questions were on topic explqined by sir though questions were gate level
length of XY must be less than or equal to N. but in both examples you are taking the length greater than N. language is infinite so its not making any difference but for cases it will create a huge difference. for example : L = { a^x b^y | 1
I have the same doubt..anybody plz clear it...
@@sameeranerella1120 see jo n question me dia hai aur jo pumping length n hai wo dono alag alag hai. assume pumping length as N aur iski value khud se set kar sakte ho ex- take Nas 5 fir us hisaab se string choose karo ke string ki length 5 se badi ya barabar ho aur fir baki condition match karo
hope this helps
My brain was getting all flustered by reading from the notes, I was trembling how to study tomorrow itself is my exam and search on UA-cam and this video popped up!! I'm really thankful sir, I've come across almost every video of yours and subscribed it...very much helpful.. THANKS TO MY NEW GURUJI
Hello same
You are an ah-mazing teacher! I wish you a successful career with time, Sir.
Excellent way of teaching , I spent more than an hour by watching a video and reading a book but can't understand pumping Lemma, but Undestand whole concept within 5 to 7 mins by watching ur video..
Dude that was awesome. I spent so long trying to understand PL and you fixed it in 12 minutes.
no one cares
Amazing teacher you are... your great efforts clear every Student concept even who is weaker in understanding concept....bless you
teaching method kamal ha ak topic 15 mint mai smjh ajata....God bless you
At once I thought I would never be able to get this concept but with the blessings of God, I found your video and guess what now I can solve any question on pumping lemma.
Thanks a lot:):)
Concepts are improving day by day in TOC because of sir lectures.
best explanation out there. you explained a concept in 10 mins that others take an hour to explain. You are the reason why i will pass my engg
Na jane sir aapko kitne logo ki best wishes aur दुआ mil rahe honge.... I think you would live 100 years or more😂.
hamesha end per bachne ka liya sukriya ☺☺
Ive referred many materials for the clear explanation of how pumping lemma works.. bt i dint understand. Now its a clear explanation. Thanku so much sir. Yesterday i started this series. Today ill finish it. Ive cleared net.Ill clear jrf this time with ur support sir. Thanku so much.... 🙏
SIR I'll support your channel from my first salary! You really deserve appreciation. Thank you so much!
Very good
Our college teacher literally took more than 1.5 hour to explain this same topic in class but still almost no student understood it.
That teacher has been teaching for 10+ years in one of the best Engineering colleges of India and that is his level, Varun Sir literally took 10 minutes!
Really shows the quality of our education system.
Thnkk u so much sir..10 11 mintue main itna bda topic aapne sara smja diya..⭐⭐⭐⭐⭐
Among all the Indians I love, Kohli is still at the 2nd place. You are great sir. Love from Pakistan.❤
according to this method,it will also disprove that a^mb^n is regular.
Correct me if i'm wrong.
Pumping leema is like semi final match: if you win then maybe or may not you win the tournament match in final, but if you loose the match in semi final then its clear that you are not going to win in the tournament 😂😂😂😂😂
What a great analogy. Thanks :)
Bhai has has k pagal ho Gaya me.... Kya dimaag lagaya hai tune🤣
you made it really easy to remember!
yeh 2 lino ne mujhe smjha diya jo mere teacher k 2 class milakar bhi nhi samjaha
lolll , true 😂😂😂😂😂😂😂😂😂😂😂😂
I study CS in a shitty University here in Pakistan where this course, Automata(TOC) is worse than a disease.... All thanks to Gate Smashers, we all( class of 200+) rely on you! keep it up!
Virtual University 💀💀
I literally stopped crying after watching this video. tq sir
xD
Thanks a lots Sir G !...May God bless you with a lots of happiness health wealth and prosperity ❤❤❤
This is how students wants to learn subject like TOC 💪💪
Sir aap k bharose se hi semester nikl rahe h ....aapke lectures college k mukable bohot sahi h ...keep it up sir 👍
Superb Explanation sir 🥰🥰
Aapki video sa sara doubt clear ho jata hai thanks sir 👌
outstanding mjhy apny teacher ki samjh nahe aaa rahi thi koi concept nh clear ho rahy thy mere but you sir app ny toh kamaal kar dia thank you
Aap itna sahi padhate ho ki esa lagta hi nahi koi sir hai samne...esa lagta hai koi bada bhai hi padha raha hai..☺️☺️❤️❤️
sir am a malayalee and i like ur classes more.... best of luck sir ....ur explanations are wonderfull
Thank you Sir for such wonderful and amazing Content!!
I wish you get 500K in the within next day.. You are so close.. 499K subs.. that's just great!
Such videos are life saver. Thank you bhaiya 🙏
Sir please please have mercy on me ......U are super super...I can bet in whole india no one can find better than you.u are lovely varun sir..Masha Allah May Allah subhanawata-alaa bless u n olwaz succeed u.m waitng for million subscribers here..N m very very sure about this.
Amazing explaination , quite remarkable sir
batao! itna sa tha aur cllg me andd shandd chal raha tha😂😂, thankyou!
😂😂
Love you bro....u literally taught me this thing which was screwing my mind since long.....
Thank you sr your explanation is very nice
your lectures are really amazing, i have subscribed your channel sir.
Amazing explanation, superb teacher you are, May you succeed in your teaching career ....thankuuuuuuuu
Important to note that the pumping lemma should be used to prove a language is not regular only when that language is NON-FINITE. All finite languages are regular since they can be described by finite automata. This was confusing to me at first because you can trivially see that a finite language will not satisfy the pumping lemma
I was too worried about my exams that I would fail this subject but by listening ur Lectures I am confident of passing this subject with GOOD Marks. Thank you So much GATE SMASHERS!!THANKs, Varun SIR!!!!
Thank you so much Sir for a good Contant
God bless you Sir❤❤❤
Always be happy & healthy 🥰🥰🥰Loving thank to you😘😘😘
very nice explaination sir n very easy to learn
Sir Love from Pakistan. understand really well
Congratulations sir for 2 millions 🎉❤
🙏🙏🙏 bhot aache sir ...🙏🙏🙏🙏
2x supermercy
Pumping lemma is one of the method to check whether the language is regular or not. finite language is always regular. hence PL is used for checking if infinite language is regular or not.
PL is negative test like hypothesis testing.
Failing test means Not regular. (Not the other way round)
Best Teacher Ever!!!!!!!!!!!!!
Sir you are best teacher
love your teaching method
Your videos will save our time mainly while studying for exam purpose...GREAT. Work bhaiya....keep Going.... #SUPPORTIVE team Zinda hai ❤
Best of luck
you saved my courses bro. Always will be thankful to u
exam starting in 1 hour and im learning from here
you are great brother love from nepal❤️❤️❤️
Fully understandable video👌👌
"Competitive exams, and even your college and university level exams ke liye bahot beneficial honge" remains constant in your lectures 😝
thanks for such great teaching way
Short and sweet, loved it
Thanks uuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuu sir apni di video mnu bhut help krdi test Or ppr vich
We can't pick string "W" arbitrarily
It's length must be greater than "n" ( number of states in FA)
how do we know number of steps in FA if the given problem is no regular language
@@vaibhavmahalle6943
In pumping lemma first we assume language is regular so their exists FA of N states which accept that language
And finally we arrive at contradiction
I will soon make video on that.
@@AmitKhuranaSir ye sahi kaha aapne kyunki agar arbitary n lenge to regular language bhi fail karengi. and partition kaise create hota hai and also tell me about the game which Peter linz has suggested in this topic.
@@AmitKhuranaSir thank you sir looking forward for your video
Like it if you came here from neso academy video of pumping lemma to clear doubt.....
Me who always comes here only 😂
🙋🏻♀️
sir but the third rule which is |xy|
we have to try to divide string s in 3 parts in all possible combination. If all 3 condition don't satisfy together then we can say it is not regular language. In the first combination 1st and 3rd both are not satisfaying.
In college lectures I feel sleepy... but now I understand more... because of Your Lectures.
kya sahi channel hai yaar....
Sir you have this concept very easy
Hand off u respected sir G☺😊😊😊
Thank you sir your explanation is best.
Crystal clear explanation❤
U made every difficult concept more easier... Thamk u so much sir.... U r the master of TOC❤️💯
Love from Andrapradesh 🎉❤️
EXCELLENT EXPLANATION ,THANK YOU SO MUCH SIR.
Bhaiya to bahut easy nikla😅
Great explanation.
Happy Teacher's day sir ❤
Nice sir 1h class you solve in 10 min
In a^nb^2n example, you took xy as a^n b^x which is not satisfying the third condition of the theorem.(xy < n). Please correct If i am wrong.
Same doubt😂
Mujhe samajh me aagya
Very Good Explanation...
Thanks Sir
BHAI SAHAB CHA GAYE AAP TO... ODISHA SE JAY JAGANNATH
Sir you are best teacher...
Great video great lecture maja a gaya 🔥
University ❌ UA-cam ✅
Bs test fail krne k liye pdhna h.... kota factory m shi bola jb sure nhi to kyu pdh rhe h hum in theories ko........ BTW... sir aap bhut acha pdhate ho😊😊❤❤❤
Bohat hard bohat hard 😢😢
example mein 3rd condition satisfy nhi hui
according to example n = 2,
but |xy| = 4
please correct me if I am wrong @Gate Smashers
ya same doubt.
Excellent explanation
Good bro
You had thought best
Nice
nicely explained👌Thank you sir!
प्रणाम 🙏 गुरु...💫
Very helpful 🤗
pumping iron padhao sir
Sir you are really great😄
Thanks Mann !! I am thankful to you 🙂🙂
I have a doubt.
We say that |xy|n!?
Then we already have taken a wrong example, haven't we??
But that is not xy it is xy^2.
|xy|
Same doubt Sir plz look into this!
@@kartikeyvishnoi2978 that is Xy only not xy^2. ..xy is aabb
Xy^2 is aabbbb...plz check
@@balaji6466they dnt clear thi doubt sir. Because the same doubt is asked in many comments for this video since from last 1 year but no reply from his people...
but this lecture is very good and understandable i like ur all sub video
Excellent sir
Sir ur lectures are awesome and easily understandable, and just for curiosity , what is ur qualification? Based upon ur class u r a legend