Lec-31: Pumping lemma for regular languages in TOC with examples
ฝัง
- เผยแพร่เมื่อ 12 เม.ย. 2020
- 👉Subscribe to our new channel: / @varunainashots
This video gives the description of Pumping lemma for regular languages in TOC. The concept of Pumping lemma is explained with example.
0:25 -Why we use Pumping lemma theorem?
1:17 -Pumping Lemma test case
►Theory of Computation (Complete Playlist):
• TOC(Theory of Computat...
Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
►Design and Analysis of algorithms (DAA):
• Design and Analysis of...
►Database Management System:
• DBMS (Database Managem...
► Software Engineering:
• Software Engineering
►Artificial Intelligence:
• Artificial Intelligenc...
►Computer Networks:
• Computer Networks (Com...
►Operating System:
• Operating System (Comp...
►Structured Query Language (SQL):
• Structured Query Langu...
►Discrete Mathematics:
• Discrete Mathematics
►Compiler Design:
• Compiler Design (Compl...
►Number System:
• Number system
►Cloud Computing & BIG Data:
• Cloud Computing & BIG ...
►Programming in C :
• C Programming
►Data Structure:
• Data Structure
►Computer Architecture :
• Computer Organization ...
►Graph Theory (Complete Playlist):
• Graph Theory
►Digital Logic:
• Digital Logic (Complet...
---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
► Subscribe to us on TH-cam: / gatesmashers
►Subscribe to our new channel: / @varunainashots
► Like our page on Facebook: / gatesmashers
► Follow us on Instagram: / gate.smashers
► Follow us on Instagram: / varunainashots
► Follow us on Telegram: t.me/gatesmashersofficial
► Follow us on Threads: www.threads.net/@gate.smashers
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:
Email us at: gatesmashers2018@gmail.com
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
You are an ah-mazing teacher! I wish you a successful career with time, Sir.
Dude that was awesome. I spent so long trying to understand PL and you fixed it in 12 minutes.
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 😂😂😂😂😂😂😂😂😂😂😂😂
2x supermercy
Amazing teacher you are... your great efforts clear every Student concept even who is weaker in understanding concept....bless you
batao! itna sa tha aur cllg me andd shandd chal raha tha😂😂, thankyou!
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 TH-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
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:):)
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
Concepts are improving day by day in TOC because of sir lectures.
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..
Na jane sir aapko kitne logo ki best wishes aur दुआ mil rahe honge.... I think you would live 100 years or more😂.
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
Thank you Sir for such wonderful and amazing Content!!
Thanks a lots Sir G !...May God bless you with a lots of happiness health wealth and prosperity ❤❤❤
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.... 🙏
Short and sweet, loved it
teaching method kamal ha ak topic 15 mint mai smjh ajata....God bless you
Amazing explaination , quite remarkable sir
EXCELLENT EXPLANATION ,THANK YOU SO MUCH SIR.
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 💀💀
Amazing explanation, superb teacher you are, May you succeed in your teaching career ....thankuuuuuuuu
I literally stopped crying after watching this video. tq sir
xD
sir am a malayalee and i like ur classes more.... best of luck sir ....ur explanations are wonderfull
Such videos are life saver. Thank you bhaiya 🙏
SIR I'll support your channel from my first salary! You really deserve appreciation. Thank you so much!
Very good
your lectures are really amazing, i have subscribed your channel sir.
Aap itna sahi padhate ho ki esa lagta hi nahi koi sir hai samne...esa lagta hai koi bada bhai hi padha raha hai..☺️☺️❤️❤️
Fully understandable video👌👌
Great explanation.
Very Good Explanation...
Thanks Sir
Thank you Sir... Amazing
you saved my courses bro. Always will be thankful to u
Thnkk u so much sir..10 11 mintue main itna bda topic aapne sara smja diya..⭐⭐⭐⭐⭐
Sir ur lectures are awesome and easily understandable, and just for curiosity , what is ur qualification? Based upon ur class u r a legend
This is how students wants to learn subject like TOC 💪💪
Love you bro....u literally taught me this thing which was screwing my mind since long.....
I wish you get 500K in the within next day.. You are so close.. 499K subs.. that's just great!
Sir aap k bharose se hi semester nikl rahe h ....aapke lectures college k mukable bohot sahi h ...keep it up sir 👍
Thank you sir, greatly explained! Can you kindly make us understand Merger Graph, Merger Table, Compatibility Graph
Lossless and Lossy Machine - Testing Table, Testing Graph from minimization of incompletely specified machines? It would be of great help.
nicely explained👌Thank you sir!
Crystal clear explanation❤
Thanks Mann !! I am thankful to you 🙂🙂
Best Lecture Ever
Great video great lecture maja a gaya 🔥
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.
Thank you sir your explanation is best.
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
love your teaching method
Superb.. tysm sir🙏
Like it if you came here from neso academy video of pumping lemma to clear doubt.....
Me who always comes here only 😂
🙋🏻♀️
Among all the Indians I love, Kohli is still at the 2nd place. You are great sir. Love from Pakistan.❤
Sir you are best teacher...
Aapki video sa sara doubt clear ho jata hai thanks sir 👌
"Competitive exams, and even your college and university level exams ke liye bahot beneficial honge" remains constant in your lectures 😝
Graet explanation.sir.thankyou..... I am studying according to rgpv exam and gate so please cover all topics as soon as possible humble request sir..
Hand off u respected sir G☺😊😊😊
Your videos will save our time mainly while studying for exam purpose...GREAT. Work bhaiya....keep Going.... #SUPPORTIVE team Zinda hai ❤
Best of luck
TH-cam tutorial > College classes
Thank you so much Sir for a good Contant
God bless you Sir❤❤❤
Always be happy & healthy 🥰🥰🥰Loving thank to you😘😘😘
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.
welldone sir. thank you!
Excellent explanation
a great thank u mam✨✨✨, previously it was little difficult to link videos and study...
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.
you are great brother love from nepal❤️❤️❤️
kamal🔥🔥🔥🔥
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
Best Teacher Ever!!!!!!!!!!!!!
Superb class sir.
Awesome man 💥
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
SIRR YOU'RE THE BESTTTTTT
Thank you sir.
Thank you sr your explanation is very nice
Sir you are best teacher
Excellent sir
Thanks so much sir🧡🌠
JazakAllah sir
Sir you are really great😄
Very helpful 🤗
Good bro
You had thought best
best lecture
Appreciated.
Sir you have this concept very easy
Sir Love from Pakistan. understand really well
kya sahi channel hai yaar....
according to this method,it will also disprove that a^mb^n is regular.
Correct me if i'm wrong.
god bless you sir!
Sooper bro
thank you !
Thank you sir.....
thank you sir
Thanku so much sir
Great
great guy
🙏🙏🙏 bhot aache sir ...🙏🙏🙏🙏
U made every difficult concept more easier... Thamk u so much sir.... U r the master of TOC❤️💯
💞Awesome vedio sir🌹🇮🇳🇮🇳💞💞