Lec-31: Pumping lemma for regular languages in TOC with examples

preview_player
Показать описание

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):

Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
►Design and Analysis of algorithms (DAA):
►Database Management System:
► Software Engineering:
►Artificial Intelligence:
►Computer Networks:
►Operating System:
►Structured Query Language (SQL):
►Discrete Mathematics:
►Compiler Design:
►Number System:
►Cloud Computing & BIG Data:
►Programming in C :
►Data Structure:
►Computer Architecture :
►Graph Theory (Complete Playlist):
►Digital Logic:

---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:
Рекомендации по теме
Комментарии
Автор

sir your 10-20 min lectures are worth than 1.5hr lecture that they teach in universities. appreciated sir, keep up the good work

sameershahbaz
Автор

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 YouTube 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

Sarah-qout
Автор

Dude that was awesome. I spent so long trying to understand PL and you fixed it in 12 minutes.

shahbaksh
Автор

You are an ah-mazing teacher! I wish you a successful career with time, Sir.

rafiachowdhury
Автор

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..

ahmentertainment
Автор

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:):)

aryanrathore
Автор

Amazing teacher you are... your great efforts clear every Student concept even who is weaker in understanding concept....bless you

SEEMAVERMA-cowp
Автор

Concepts are improving day by day in TOC because of sir lectures.

singingvibes
Автор

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

samriddhigulati
Автор

Ye kesa language he kuch smjh nhi aa rha tha bss aapke video hi meko help kr paye !! ❤

TechnoBanDa
Автор

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<x<300, 1<y<400 }

harpreetsharma
Автор

teaching method kamal ha ak topic 15 mint mai smjh ajata....God bless you

samanrafique
Автор

This is how students wants to learn subject like TOC 💪💪

amritpanta
Автор

SIR I'll support your channel from my first salary! You really deserve appreciation. Thank you so much!

aimenbaig
Автор

You're doing gods work. I truly appreciate your time and effort and service

djrkm
Автор

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.... 🙏

thakkudubala
Автор

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 😂😂😂😂😂

gulzarhussain-mppm
Автор

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!

ramzyIC
Автор

hamesha end per bachne ka liya sukriya ☺☺

AmaimaAmir
Автор

Thanks a lots Sir G !...May God bless you with a lots of happiness health wealth and prosperity ❤❤❤

sherazahmedahmed