Nonregular languages: How to use the Pumping Lemma

[@rtasvadum1810]

Again, this is higher quality than a majority of the classes I have taken so far. Thank you so much.

[@aloafofbagels6381]

That makes two of us.

[@tw3039]

@@aloafofbagels6381 And three

[@kennethaidoo361]

4 in mutual agreeance

[@jaredcortes366]

5 in one accord

[@stupidbro3983]

6 weary seekers of truth

[@rsia08]

5-minute concise explanations are so much better than lectures that are over an hour long. Much easier to remember :)

[@LL43216]

Literally summed up like 2 hours of my lecture in 5 minutes thank you so much

[@csgo-gamer8765]

This channel is criminally underrated! I cant emphasize how much this comic style awesome, adorable and clean is in its explanations. Thank you very much and keep up the good work!

[@VahiMangai]

This is exactly what I needed before my teacher had us retake the test.

[@simplystephanie595]

Your videos explain content better than my whole semester of class. Thank you.

[@afonsosantos1416]

You're litteraly saving me on Computing Theory

[@soccerfan2969]

This saved me. Thank you so much. Sharing with the rest of my class right now.

[@RagingAcid]

This guy doesn't understand how to get a cheeky curve

[@heyjoeway]

@@RagingAcid lmao that's fuckin evil

[@BenBurgersJr]

Thank you so much for this clear explanation and accompanying animation! Very clear and concise.

[@HasanZobaer]

Yet another top quality video! From animation to explanation and the funny art style to the soothing voice its all just prefect! This channel is so underrated :'(

[@guywhodiedwithouthisdawg6260]

notice how non-regular language is so chill bout not being a regular language bro has a positive attitude

[@guywhodiedwithouthisdawg6260]

love your videos tho just subscribed

[@sungwoooh4919]

Thank you!! your voice is beautiful and easy to understand :)

[@xiaoqingtian6542]

You saved my life within 5 minutes.

[@top10top54]

wonderful video ...waiting for context free languages

[@marcos-vx3qj]

This video is excellent, it simply explains this confusing topic

[@hassanjaber8169]

DUDE YOU ARE A GODDESS, THANK YOU

[@mr.froschi6526]

Thank you very much. I really liked the video. Honestly a kinda underaprecciated channel now that i look at the subs and views. You deserve more. Keep it up.

[@complexity4760]

I wish you still did these sort of video!

[@suaie]

Thank you. You are smarter than Neso Academy

[@gbemisolaagboola8255]

well, i dont need a pumping lemma to proof you are not regular, amazing! for basic understanding ofcourse

[@zudiaq8678]

You definitely should open your own university. and then you should just sit there as a tutor and play these vids... you will be a tutor of the year for sure. :) thanks for the great explanations. helped me a lot in my exams.

[@anmolacharya309]

This is great! Wish there was more videos where you did example question for tricky problems as well!

[@sahilahmed5228]

when u take 3 cases, in those last 2 cases, you are taking y such that |xy| is already greater than p. You basically need to chose a y such that |y| is greater than 1 and less than p and |xy| must be less than p.

[@BlurCell]

can you explain this more please

[@giggityyy...]

I have been on KZbin since as log as I can remember,I can say this is TOP-NOTCH content 🔥.

[@michaelshevelin2234]

Lydia! You're the best! Thank you so much for your work! I would happy to see videos of yours about some problems like determining if the language is finite/ empty etc. Thanks again!

[@giovannilibrizzi]

this video may have just saved me for my midterm omg

[@harleykf1]

Thank you! Your videos are exceptional :)

[@slabbert]

Thanks so much! Truly helped more than any other sources I've encountered.

[@lumiere2598]

I am really in love with your videos, please make more! (I'm spreading the words :D )

[@Josh-tu9ji]

These animations are soooo good. Please make a whole series on Automata! TYSM

[@zodiackwolf]

Fantastic video, thank you so much! Really made it much easier to understand proving non-regularity and my understanding of the pumping lemma too :)

[@chehakmalhotra860]

Beautiful playlist. Loved it

[@l.w915]

very clear, love the pictures and the flow. thank you.

[@cheeesysandwich]

Thank you so much; this was amazing! Just gave you your 1,000th like

[@merkezbir8663]

Better than sermutlu guy on KZbin but taylant is great

[@gavinunrue2282]

amazing vid! The textbook or professor does not do this concept any justice lol

[@nicholeconroy4558]

Can you please make a video about regular expressions and more on proofs please these have been very helpful

[@samarthtandale9121]

Wow! This was a great proof indeed!

[@tahamian4822]

I love your video! Please keep it up!

[@anastasiiabukhanova1877]

This is worth a lot! Thank you!

[@oreoshake5951]

Thank you so much. This was very helpful and I was also confused in this part but now this is very clear.

[@iskerop]

best explanation ive seen, thanks!

[@michelebissanti9055]

you have saved my life! thanks

[@Antonio9648]

Great explanation

[@marsdelver8349]

These videos are so helpful, thank you!

[@minhbeo0909]

Please increase the video audio quality next time. It's hard to hear through the speaker. Otherwise, the video is very helpful thank you!

[@adlai1]

I hate that this video is 2 years old. Please make more videos!

[@makenuo9041]

Sorry, I was so distracted by the beautiful sound of your voice - couldn't focus on what you were saying at first :-) But seriously, a great video, very intuitive and with nice metaphors like the "all-knowing Pumping Lemma" on its throne. Thanks for this!

[@lifetimeknight]

better than automata course that i take in the college.

[@aliyyah82]

Wonderful video!

[@mv8309]

Thanks for this ❤

[@SzechSauce]

Brilliant! Thank you!

[@aviuss]

[@matinaminsabouri]

Thank you so much

[@madelynn_manis]

This was super helpful thank you so much!

[@dhruv_jain99]

In regular language we can make state diagram, so we know, number of states=p but in non-regular language we cannot make state diagram for language. then how we are going to find p for non-regular language?

[@i3aluchi]

To my humble knowledge, we don't necessarily choose P as the number of states as it is dependant on the language and not the machine.

[@sunviewer7]

Super good explanation!!!!

[@skyehelfant]

Great video

[@aster4405]

how to determine what length p to use?

[@mangilalkaler3497]

At 4:30, I assume you wanted to say : Assume the language is regular. Then given P, we find a string that can't, in fact, be pumped and still be in the language. This proves the language is non-regular, which contradicts our initial assumption.

[@tuankhanhtrinh4891]

I wonder if we choose the string 0^p1^p and choose y to be 1^p. Doesn’t it not satisfy the condition of |xy| =< p? 😃

[@kUmerZaidiSyed]

10/10 video

[@astronautadomestico1343]

Ty so much

[@JakisMaciek]

Thanks! :>

[@QuesterDesura]

very well done :)

[@crawbug8932]

1:07 What about finite regular languages? They don't satisfy the pumping lemma but are still considered regular.

[@jixster1566]

3:13 how are cases 2 and 3 possible if |xy|

[@amirhosein5677y]

Thankssssss

[@fahidabdullah5637]

Hi I had a question regarding the 3 cases for the pumping lemma. If we could prove one of the cases was true for the y value chosen, and it met all the three conditions for pumping lemma, then that would show the language is regular then, correct?

[@shyngysbek6907]

How do you define p? I know it is a pumping length but how you define it when you don't know which length is a pumping string?

[@AbcdEfgh-nq5bw]

Is there any Language L such that L is not regular but L^2 is regular?

[@jasonzheng5839]

amazing. what am I paying my professor for

[@harshit1206]

Loved this!

[@drublacky1846]

😍

[@carpedm9846]

Couldnt you have chosen a pair of 01, and thus keep the sequence? 010[10]1->010[10101010]1

[@iliasvrynas9189]

Yes but I think you need to find at least one sequence that is not part of the language

[@cirosilvano6950]

The language you’re talking about is different though. She was proving that the language consisting of an uninterrupted sequence of n 0s followed by an uninterrupted sequences of n 1s is irregular. Strings in such format correspond to stuff like 000111, 01, 00000001111111 and so on, while 01010101, for example, doesn’t belong to such language.

[@Shyzah]

pushing p

[@blowingupcasinos]

This rules

[@BehniaFB]

But the volume was too low...

[@sindoni_sw8792]

thank u very much