Pumping Lemma For Regular Languages This lecture shows an example of how to prove that a given language is Not Regular using Pumping Lemma. a^n b^n is not regular language where n greater then and equal to 1
The biggest problem with professors explaining this is not showing every step. THANK YOU for showing every step. Language doesn't matter, teaching style does matter.
We assume the language grammer string it may goes infinite and generally we takes some of them (let say), so how do we can say confidently that that given case 3 is not present in the string?
Mam thank you sooo much... I have seen so many vedios related to this.. I dint understand anything.. But your teaching is best of alll.... I understood.... Thank you sooo much mam.... Do some more problems on this mam... Please.... Mam
The biggest problem with professors explaining this is not showing every step.
THANK YOU for showing every step. Language doesn't matter, teaching style does matter.
I don't know a word of Hindi but I understood this better than any lecture ever. Wow!
It's urdu
what is the difference between hindi and urdu
and Thanks for this lecture
😊@@qasimumar4365
First time....i understand the this concept clearly because of teaching method is so great and so simple that im able to understand.
n = pumping length. Means the value we gave to ' n ' for the language a^nb^n
Not the length of the entire string
Means Case 1 is False
I have Studied many videos for this topic but you have explained in such a way that i understand completely many many thanx Mam
bahut achche se aapne explain kiya, shukriya
allah apko aur bhi behtar krne ki taufeek ata farmaye......
Simple explanation very helpful
Short and Crisp... Thank you ma'am for your kind efforts
Thank u Baji.😊.. awesome explaination
Mam Please Kindly upload a tutorial series that cover all the topics of Regular Languages and Non-Regular languages...
was case 3 true or false ? and why? thats the only part I didn't understand !
Too Good explanation mam...
Wow, what a time saving and accurate explanation!
"n" is the pumping length not the length of the string.
Here for "aabb" , n=2 as the language is (a^n b^n)
Apka samjhane ka tareeka bahut accha hai.....Aur jyada video banaiye .....And thanks ...Apki vajah se meri problem solve ho gai
Very very Simplest explanation
He is a brilliant person in the world. I appreciate you bro thank you for the videos.
waaaooo.....it's so simple easy to understand....thanku mam
best and simplest explaination i have seen on these topic
masallah crustal clear concept..(Viewer from INDIA..💐
Thanks a lot mam 👌👌👌👌
great explanation . thank you ma'am
I really like u style of delivering is very simple i like it
Pakistan zinda abad
Great explanation about this topic..can u also make a video about Turing machine asap..
gurdit singh sure i will soon
Thank you
Shi kha bhai.. Tuning machine, pda
Help me.. Ek video daal do
@@ComputerScienceNotes madam pls send me Some Touring machines vedios Because Your teaching skills is Best.
Ever
Maam aapka bahut shukriya.....ye topic bahut confusing tha aur ATC difficult subject hai .....par aapke video se mujhe samajh aagaya😍.....aur exam bhi achha gaya aajka
Best teacher ever
thanks mam you clear my doubt plz upload more videos of automata
Thank you mam.. Thank you 😄
And plzz continue wid hindi version.. Becoz hindi way understanding is better than English 😆
Thanks ma’am for kind effort
thank you ma'm for explaining so clearly
Didn’t understand what you said but did understand the steps showed thank you 🙏
We assume the language grammer string it may goes infinite and generally we takes some of them (let say), so how do we can say confidently that that given case 3 is not present in the string?
So Easy explanation.
Who is watching this in 2022 👇👍Thank you mam 😊
me in 2024
Excuse me mam i have a doubt abt turing machine design..... If there is a black space at start of the tape does it accept or reject
Wonderful! u really saved my life! Thankyou :
best explanation mam thank you for pumping lema teach us
JazzakAllah
Very helpful😊
Thank you for this video mam👍🏼
Sister god bless uh....nice video...I'm mtech student
thank u mam
very good explanation
Thanks for this video
Thank u mam this lecture help me a lot. Keep it up.God bless you
simple and straight thank you !
superb ....simple and short
Awesome Technique..
Thank you, ma'am
Very nice explaination
superb
thank you so much ma'am aapne fail hone se bacha liya 🤒
Awesome video.....yu really a great teacher
U saved me in my exam !
Apply pumping lemma to following languages and understand why we cannot complete proof
L = {anaba | = 0}
i am very thank full .......to you
Ere
Ye to samaj me aa gya 😮.
Thanku di
thank u for explaining it in simple words
Mam thank you sooo much... I have seen so many vedios related to this.. I dint understand anything.. But your teaching is best of alll.... I understood.... Thank you sooo much mam.... Do some more problems on this mam... Please.... Mam
Thank you
Wa alikumasalam mam thank you so much your video's helped lot
wow mam . awosome wonderfull mza aa gaya ...please make more videos on this subject.....thanku
Thanks for sharing...
thanku so mch ma'am your explaination is literally too good
Ma sha allah very nice Explanation 😍😍
Thx 🙏🏼
Btw your voice is so sweet
Nice explaination mam.. thank you so much
explained very well. excellent. keep it up.
great explanation...please put more videos on toc...
thanks mam
unlike my doctor you made it so easy.
thannk u so much mam
Ma'am very very thanks. From bottom of my heart it's just like
डूब ते को तिनके का सहारा,
Anany Sharma thank you for appreciation
Yeh explanation kaafi achi hai. Ispe subtitles daalo, jyaada logo ko help milegi
I agree! English is almost like a universal language.
Nice mem thanks for this video
thank you
Simple explanation
Thank you 🙏 mam
Mam thx so much 😘😘 very good ji
You are great mam..
Thank you so much mam apne mere 10 number bacha lia
Nice explanation
Thank you ma'am.... :)
Why did u stop making videos....It was gr8 content
Thank you mam
best expn mam thank you mam for pumping lemma explanation
thank you mm for this wonderful video...
Thanks for this video.It was very useful for me....
isn't case 1 trivially true?? the length of a substring can never be greater than the string of which it is a part
according to what I've learnt
|xy|
same thought i came accross with
Thanks explanations is too good
best explanation on youtube.
Awesome, thankyou so much ma'am.
Walikum Assalam Aapi ❤❤
Thanks alot mam
You took n =2 then you are saying n is length of total string, why???
Awesome 😎😎
awesome, that was very straight forward! keep it up! good work
Thanks again.. Great explanation
very easy explaination thanks...
Walaikumassalam ma'am
Tq do more video mam..
Thanks