This 5 minute video finally made me understand the pumping lemma, and I actually get *why* I'm doing certain things when proving that a language is non-regular now, instead of just going through the steps blindly!
See, in 5 minutes I learned more than I did in the 75 minutes I spent in class going over this. Why can't professors explain stuff like this? Awesome video, Lydia. Thanks for the explanation!
300th like! Thanks so much for making these Theory of Computation videos, theyre so well animated and you explain everything perfectly. If you set up a patreon I will support!
Thank you! Before your video I was clueless as to how the pumping lemma worked and what the terms actually meant but now you have made everything so clear for me.
Amazing explanation! :D Ive got one small question: You said '01111' cannot have '1111' as the pumping value because the pumping value must be in the first P characters, So out of '011' is '0' the only pumping value for state Y or is it also possible that '1' is? im asking this becuase both 0..011 will be accepted and also 011...1, Thank you!
To find pumping length just draw the minimum dfa and pumping length should be greater than equal to the number of states in the minimum dfa minus the dead state. You can't pump b here. It is not necessary that every y can be pumped we just need to find some y for which the pumping lemma holds.
"If a language is regular, then every string in the language will have a section that can be repeated (or pumped) any number of times and still be in the language". I do not understand this as I thought a language is a set of strings, for example L = {"one", "two", "three"}. How do all strings in L have sections that can be repeated any number of times and still be in L? Thanks for reading to here, feels like I have misunderstood something.
I could be wrong as I'm still trying to get my head around it but I think the difference with your example is that L = {"one", "two", "three"} is a finite language whereas the pumping lemma proves it for infinite languages where there may be repeated sections. As it is a finite language, I think the proof would probably be simply that the language is finite so it must be regular.
@@HyperGadgets To add a bit more, the pumping lemma still applies. The pumping length p is just a value larger than the longest string. As a result, there are no strings of length >p in the language and so the three conditions are not broken. For infinite languages, you can't have such a long enough p.
I don't understand why the second condition states that |y| > 0 while the first one claims that xy^iz for every i >= 0, but if i = 0, it would contradict the second condition.
xy^iz for i >=0 ... means that y can appear 1 or more times |y| > 0 ... means that the length of y cannot be 0, in other words it cannot be a null string SO the first one has to do with no. of occurrences of y, while the second one has to do with the length of y Hopefully it makes sense now :))
What if i consider the language : set of strings that has 101 as substring. And than divide the string 11011 as: x=11 y= 0 z= 11 Now if i pump the string twice (i=2) the the pumped string becomes 110011 which does not belong to the language. So is the language Non Regular?
Great videos! Only complaint is I have to keep my volume @ 100 and can still barely hear your. This is true for all of the videos I have watched thus far.
I would suggest getting a new microphone, because for me I can barely hear you. Otherwise this video helped a lot, your examples, diagrams, and your way of explaining things are good. great job
![[#2024MAMA] BIGBANG (빅뱅) - 뱅뱅뱅 (BANG BANG BANG) + FANTASTIC BABY | Mnet 241123 방송](http://i.ytimg.com/vi/EQsYfiPR9uM/mqdefault.jpg)
“The proof of a high education is the ability to speak about complex matters as simply as possible.” -Emerson
Yeah without pride
Her voice captivated my attention which dozens of other professors couldn't. Good job!
girl you saved my life
This 5 minute video finally made me understand the pumping lemma, and I actually get *why* I'm doing certain things when proving that a language is non-regular now, instead of just going through the steps blindly!
Your way of explaining these topics are so gentle and caring 🥺 Thank you, Lydia ❤️
omg, the way you just explained 2 weeks worth of class in 5 minutes.............. Im speechless lol THANK YOUUUU!
How can someone like you stop making videos!!!!! your videos are so simple and SO effective! BRILLIANT
See, in 5 minutes I learned more than I did in the 75 minutes I spent in class going over this. Why can't professors explain stuff like this?
Awesome video, Lydia. Thanks for the explanation!
happy halo, bow down to Demon :D
This is the best explanation of the Pumping Lemma I've seen this far :)
This is my new favourite educational channel. And thats a fact.
This is a perfect explanation. Thank you! Where is your patreon haha?
This video has 0 dislikes and for VERY good reason. You just explained something in 5 min that I couldn't for the life of me understand in 2 hours.
300th like! Thanks so much for making these Theory of Computation videos, theyre so well animated and you explain everything perfectly. If you set up a patreon I will support!
Brilliant video which is a sad constant reminder that TH-cam > University courses
Thank you! Before your video I was clueless as to how the pumping lemma worked and what the terms actually meant but now you have made everything so clear for me.
girl you saved my life
These are incredible btw
I'm having such a hard time in this course and these videos really helped me catch up to the classes.
same, don't even know why we still go to college since you can find better teachers online for free these days
You are a joy to listen to, you know the material well and your teaching style is easy to follow.
Such a good video! It's so much simpler to understand.
This is so helpful, thank you so much :)
Great explanation! The way you worded the properties of the lemma made it much easier to understand : )
I didn't know Logic could be this fun! Hehehehe. Loved it.
Thank u smmmmm!!!!!! I was gonna drop the class until I found ur chennel
back after my exam grades, got full mark on this,, thank you
Thank you Lydia, this has been very helpful :)
I wish you made more videos i went through them all in preparation for my 2nd midterm
This video is straight up 🔥
Thank you very much. This was very helpful.
Can you please share the font name used in the video?
she made me understand the concept of pumping lemma in 1:11 minutes, a concept that i couldn't grasp from the lectures 💀
Simply amazing.
this is such a cute and helpful translation
Amazing explanation!
Great explanation, Thanks!
Super helpful explanation :)
Yay. Welcome back...
You explained it so well, thank you! my teacher could never lol
please keep making more videos!
Your voice is amazing
Simple and to the point!
Does anyone know how we settle on the pumping length p?
When anime designer become computer science teacher...why are these videos are so cute and your voice🥺🥺🥺
Arts+Science
Quality content.
This is a hidden gem
I don't know what field of math this is, but it's interesting. Can't help thinking about pumping though. Thanks
love your animation!!!!!
great explanation, thank you
Thank you for a such great video!
Thank you 🥺❤️
thank you lydia!
Amazing explanation! :D Ive got one small question: You said '01111' cannot have '1111' as the pumping value because the pumping value must be in the first P characters, So out of '011' is '0' the only pumping value for state Y or is it also possible that '1' is? im asking this becuase both 0..011 will be accepted and also 011...1, Thank you!
Yea it can be.
Awesome video. Thanks a lot!
this is amazing, thank you
Jesus, can you replace my professor?
why did you stop posting . i really liked your videos
thank you for saving me ...
Lydia the explanation is really good but you please make video with loud sounds :)
so much better than my russian teacher, tysm
Quality > Quantity
watching this 45 min before exam 10/10 video
I had to pump my volume all the way up to hear you clearly.
Maybe that was intentional 😂
Awesome Video!
Is the pumping length p always the same as the number of states?
Great video, thanks.
Thanku
Thank you!
Is it true for finite regular languages also.
Underrated
I love this video omg
Thank you so much!
*Someone please tell me how to find pumping length and can you pump b in regex (a)*b 😭*
To find pumping length just draw the minimum dfa and pumping length should be greater than equal to the number of states in the minimum dfa minus the dead state.
You can't pump b here. It is not necessary that every y can be pumped we just need to find some y for which the pumping lemma holds.
You should be teaching Theory of Computation somewhere. Seriously.
"If a language is regular, then every string in the language will have a section that can be repeated (or pumped) any number of times and still be in the language". I do not understand this as I thought a language is a set of strings, for example L = {"one", "two", "three"}. How do all strings in L have sections that can be repeated any number of times and still be in L? Thanks for reading to here, feels like I have misunderstood something.
I could be wrong as I'm still trying to get my head around it but I think the difference with your example is that L = {"one", "two", "three"} is a finite language whereas the pumping lemma proves it for infinite languages where there may be repeated sections.
As it is a finite language, I think the proof would probably be simply that the language is finite so it must be regular.
@@HyperGadgets To add a bit more, the pumping lemma still applies. The pumping length p is just a value larger than the longest string. As a result, there are no strings of length >p in the language and so the three conditions are not broken. For infinite languages, you can't have such a long enough p.
amazing video!
Now I understand!!!
so helpful thank u sm
I don't understand why the second condition states that |y| > 0 while the first one claims that xy^iz for every i >= 0, but if i = 0, it would contradict the second condition.
xy^iz for i >=0 ... means that y can appear 1 or more times
|y| > 0 ... means that the length of y cannot be 0, in other words it cannot be a null string
SO the first one has to do with no. of occurrences of y, while the second one has to do with the length of y
Hopefully it makes sense now :))
great video
What if i consider the language : set of strings that has 101 as substring.
And than divide the string 11011 as:
x=11
y= 0
z= 11
Now if i pump the string twice (i=2)
the the pumped string becomes
110011
which does not belong to the language.
So is the language Non Regular?
110011 ends with "11" so it belongs to the language
Great videos! Only complaint is I have to keep my volume @ 100 and can still barely hear your. This is true for all of the videos I have watched thus far.
Thank you! Before this i have broke my mind tryn' understand this shit
Thanks
thanks!
oh my this is actually cuteeee
So isn't a language where length of each word is 5 a regular language 🤔 ... ?
does god speak vietnamese ?
I would suggest getting a new microphone, because for me I can barely hear you. Otherwise this video helped a lot, your examples, diagrams, and your way of explaining things are good. great job
i luve u
Great vid but the audio is very very quiet
I can disprove this with just 4 states
drink water
Great video. thanks!