Pumping Lemma (For Regular Languages) | Example 2

TOC: Pumping Lemma (For Regular Languages) | Example 2

This lecture shows an example of how to prove that a given language is Not Regular using Pumping Lemma.

Music:
Axol x Alex Skrindo - You [NCS Release]

[kevinstefanov]

God bless you, my Indian friend. You are the reason I finally understood the Pumping Lemma stuff. SO MUCH better explained than in my lecture slides!

[sychik]

thank you and the people who have pointed out that the proof was incorrect. your videos still helped me understand what the f is a pumping lemma and what exactly I need to prove and how it works, so I'll just refrain from assuming the length of P in the proof. I had no chance of ever understanding this just by reading our professor's material. theory of computation is complex and abstract enough on its own, so it's twice as important to explain this subject consistently, little by little and in simple terms

[Alisi]

I went through almost all the pumping lemma videos here on ytube and I was like "Will I ever be able to understand pumping lemma?" but this and other two pumping lemma vids of yours saved me. Seriously, you explained soo well..thank you thank you! :) :D

[ngdharashive]

It is best ever simplest form of explanation of Pumping Lemma for proving certain languages are Not Regular, I am glad to see this.

[jaspreetKaur-fmjd]

You got an amazing talent of explaining the concepts in such an easy and detailed way. Thank you. Please can you give some more examples of pumping lemma. The concept is clear but still having some doubts when it comes to another questions of proving languages not regular.

[Αηομ]

Exams in one week and I've noticed that my lecturer is getting all he's "teaching" us from this channel, even the exact same examples😂

[archentity]

Great video as usual. But in the beginning of this video it isn't clearly explained why 0101 cannot be stored by a Finite State machine. Yes FS machines can store memory, but only FINITE amounts of memory. 0101 CAN be stored in an FS, but the problem is that yy can equal 0101, 00110011, 11001100, ..., etc. because each y is a word that is an element of the Kleene closure of the alphabet of {0, 1}. This means that each y can equal a string of infinite length and THATS why it can't be stored in a Finite State machine.

[leo_]

very nice explanation about the relation between "memory" and the limitation of finite state machines.

[ajmalkhaniit]

Too easy methodology of teaching like your way of teaching!

[Islamoholic_vibes]

In |xy|<=|p|
It is 2×4=8<7(pumping length)

But here conditions gets wrong so is it not regular condition

[UtaShirokage]

Just to clarify to any person watching this. He chooses 7 as, but when you prove (disprove) something using the pumping lemma, you don't even need to choose any number. Your answer can be completely theoretical.

[utkarshmishra]

What is the procedure of deciding the number of x y and z. How do we select that these 4 zeroes are y and starting 2 is x and rest is z

[fridaaa]

3:00 how did you decide the string S? And how do you decide the pumping length?

[palagirikeerthana]

Ur teaching is simply awesome...ur videos gives me confidence to do other problems in theory of computation

[azuretang]

thank you so much for teaching me pumping lemma!!!

[Kabir-pjre]

sir i have a doubt in this example you took 0 power p and 1 .why did'nt you took (01) whole to the power p. please explain.

[akkick]

If it is {0, 1}* we can also take Y= 0^P 1^P
that means S can also be
S= 0^P 1^P 0^P 1^P
Correct me if iam wrong?

[guni]

why the S = 0 raise to the power p and 1 specifically and not S = 01 raise to the power p like you did in previous lecture?

[kevinparmar]

Do we have to show all 3 cases compulsorily or is one case where it proves it is not regular is enough?

[shivangssinha]

In this example there is only 1 case but in previous example there were 3 cases can you explain that? And thanks a lot for teaching me TOC.