Pumping Lemma for Regular & Non-Regular Languages with Examples in Urdu/Hindi

Рет қаралды 35,780

A Z Computing

Күн бұрын

Пікірлер: 57

@EnglishWithAliAkbar 8 ай бұрын

Deserves more views that of you have

@mohilkumar1602 2 жыл бұрын

😀nice explanation sir best for pumping lemma

@muzamilkobik4009 2 жыл бұрын

Thanku so much sir jii kl mera paper hai apki videos sy mjhy bht mili Allah pk apko is ka ajar dain 🥰

@abujar.786 9 ай бұрын

Mera to abhi he 2 ghante bad😂

@MuhammadHassan.official155 9 ай бұрын

Mera bi kal h😂😂😂😂@@abujar.786

@umarafzal8009 4 ай бұрын

Deserve more than 5M subscriber and 10M views on one vedio

@azcomputing 4 ай бұрын

thanks, Your appreciation means a lot to me

@poonamraut1769 2 жыл бұрын

Thank you sir , college me khuch smj me hi nhi aya tha ab smja

@chtalha9773 3 жыл бұрын

Excellent bhai very helpful video

@umarafzal8009 4 ай бұрын

Sir kmall method❤❤❤

@sdansari7541 Жыл бұрын

Wonderful Explanation❤❤❤

@muhammadidrees4129 3 ай бұрын

What an explanation ❤

@maazali9672 Жыл бұрын

such a great explanation😍😍

@SidraBibi-ho7ri Ай бұрын

Thank you sir 😊

@muhammadhamzakhan9695 Жыл бұрын

Thank you sir! excellent work

@malikshahban2620 10 ай бұрын

I like your efforts ❤❤❤

@vedantsalvi5536 4 ай бұрын

thank you sir

@nimrawani7574 2 жыл бұрын

Thank you sir its really help me

@azkaaziz6666 3 жыл бұрын

Very nice explanation

@sharoontariq Жыл бұрын

Mza agya

@arsientertainment3743 3 жыл бұрын

Thanks sir this video is very helpful and good

@azcomputing 3 жыл бұрын

Welcome

@tech4inspiration619 2 жыл бұрын

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

@nawabzadi678 Жыл бұрын

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

@laxmilodhi3890 3 жыл бұрын

Thanks sir

@Digitalmind2245 Жыл бұрын

Nice sir 🥰

@SmilingChefHat-wh9su Ай бұрын

Difference between pumping lemma for CFLs & pumping lemma for regular language?? Is these are different from one another? Answer me plz...

@shadman.edu123 4 жыл бұрын

Zabardast bro

@a.jgoldhouse 3 жыл бұрын

Good sir

@UsmanGenius 9 ай бұрын

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?

@ArshadMehmood-qk7hw Жыл бұрын

❤❤❤❤❤❤

@MadGenious Жыл бұрын

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?

@arehman3304 3 жыл бұрын

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.

@azcomputing 3 жыл бұрын

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.

@BollywoodUniversity786 2 жыл бұрын

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

@fairystar4869 3 жыл бұрын

Sir plzz myhill nerode theorm ka bta dain..,possible ho tu kal tak ...perso sham ma paper h

@ahmedraza6101 Жыл бұрын

Very nice explanation sir🤌👌

@baseermalik829 Ай бұрын

kindly map it on any regular expression please

@arehman3304 3 жыл бұрын

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.