@@azcomputing sir ma nay pumping lemma for non language wali example may X=3, Y=4, Z=3 put kiya ha or jab Y ko pump kia ha to wo a^n and b^n equal aa gya ha, please guide me
@@tech4inspiration619the ending string will be aaaaabbaabbbbb which is not in the language as their is a sequence required in the question that number of b's must be followed by equal number of a's so it's non regular language
What if we divide S in such a way that X Y and Z still follow the Description even after Pumping Y? For example, instead of considering Y as 4 b's after the 1st b.. We consider Y as the middle, 3 a's and 3 b's? So when we pump, it will still satisfy the RE.. The point is, whaat is the criteria of division of S between X Y and Z?
Dear Sir, Thank you for the explanation. I am watching your videos from Italy and My exam is on 26th January 2022. My professor taught this topic in a very different method. I just need to ask that how do we prove it in a mathematical fashion.
First of all thanks for watching. Yes, there are different and multiple methods to cover a single topic. Similarly we can prove it in mathematical fashiin in different ways. Basically, pumping lemma is used as a proof for irregularity of a language. If a language is regular, it always satisfies pumping lemma.
I would love to hear from You if you could provide these mathematical proofs using pumping lemma: L1 = {a^p b a^q b a^q b a^r | p, q, r >= 1} L2 = {a^p b a^q b a^q b a^q+r | p, q, r >= 1} L3 = {a^p+q b a^q+r | p, q, r >= 1} State whether L1, L2, and L3 are regular languages, and provide mathematical proof.
😀nice explanation sir best for pumping lemma
Deserves more views that of you have
Deserve more than 5M subscriber and 10M views on one vedio
thanks, Your appreciation means a lot to me
Sir kmall method❤❤❤
Thank you sir , college me khuch smj me hi nhi aya tha ab smja
Thanku so much sir jii kl mera paper hai apki videos sy mjhy bht mili Allah pk apko is ka ajar dain 🥰
Mera to abhi he 2 ghante bad😂
Mera bi kal h😂😂😂😂@@abujar.786
What an explanation ❤
Thank you sir 😊
Difference between pumping lemma for CFLs & pumping lemma for regular language?? Is these are different from one another? Answer me plz...
Excellent bhai very helpful video
Wonderful Explanation❤❤❤
such a great explanation😍😍
I like your efforts ❤❤❤
Thank you sir! excellent work
Thanks sir this video is very helpful and good
Welcome
@@azcomputing sir ma nay pumping lemma for non language wali example may X=3, Y=4, Z=3 put kiya ha or jab Y ko pump kia ha to wo a^n and b^n equal aa gya ha, please guide me
@@tech4inspiration619the ending string will be aaaaabbaabbbbb which is not in the language as their is a sequence required in the question that number of b's must be followed by equal number of a's so it's non regular language
thank you sir
What if we divide S in such a way that X Y and Z still follow the Description even after Pumping Y?
For example, instead of considering Y as 4 b's after the 1st b.. We consider Y as the middle, 3 a's and 3 b's? So when we pump, it will still satisfy the RE..
The point is, whaat is the criteria of division of S between X Y and Z?
Thank you sir its really help me
What in the case if starting condition is ab and ending is bab, in that case I found pumping lemma is giving false result, is it?
Dear Sir, Thank you for the explanation. I am watching your videos from Italy and My exam is on 26th January 2022. My professor taught this topic in a very different method. I just need to ask that how do we prove it in a mathematical fashion.
First of all thanks for watching.
Yes, there are different and multiple methods to cover a single topic. Similarly we can prove it in mathematical fashiin in different ways.
Basically, pumping lemma is used as a proof for irregularity of a language. If a language is regular, it always satisfies pumping lemma.
Jazakallah sir.
You're method is great
Sir agr a ki power 834
Or b ki power 733
Ya kasy slove krny gy
Kindly tell me
Mza agya
❤❤❤❤❤❤
Very nice explanation
Nice sir 🥰
Thanks sir
Sir plzz myhill nerode theorm ka bta dain..,possible ho tu kal tak ...perso sham ma paper h
kindly map it on any regular expression please
Zabardast bro
Good sir
Very nice explanation sir🤌👌
I would love to hear from You if you could provide these mathematical proofs using pumping lemma:
L1 = {a^p b a^q b a^q b a^r | p, q, r >= 1}
L2 = {a^p b a^q b a^q b a^q+r | p, q, r >= 1}
L3 = {a^p+q b a^q+r | p, q, r >= 1}
State whether L1, L2, and L3 are regular languages, and provide mathematical proof.
3041
3011
3012
3027
3043
3009
3033
3058
3022
3023
very good explanation
3014
3018
3035
3037
3019
3044