Chapters: 0:00 - Introduction 1:30 - Can we guarantee a loop? 4:00 - Strings of length n see n+1 states 7:55 - Pumping Lemma statement 15:00 - Three properties of the Pumping Lemma
I thank you a lot for this video. I am gonna take the exam on the 22th July of Theory of Computation and this helped me clear some doubts. Morevorer, I really like the way you get excited as soon you prove something cool. Thanks again!
This is such a good video & so well explained! Love it, really helps with my understanding :) The part around 14:45 in particular is mind blowing & eye opening!
Thank you for this! awesome content. Would love to see how we can transform a FA into its minimum possible states from a state table. (Not sure what the name of these types of problems are called)
William Macleod I've already done it! It's not a highly viewed video on my channel but if you look for minimizing a DFA you can find it. (It uses the table method in disguise)
![ว้าว!ลุงบีมแบกทองมารับขวัญหลานกันยกบ้าน [cc] แดนแพทตี้ SS2 | EP.49 |](http://i.ytimg.com/vi/Osihq1OAs-4/mqdefault.jpg)
Chapters:
0:00 - Introduction
1:30 - Can we guarantee a loop?
4:00 - Strings of length n see n+1 states
7:55 - Pumping Lemma statement
15:00 - Three properties of the Pumping Lemma
I thank you a lot for this video. I am gonna take the exam on the 22th July of Theory of Computation and this helped me clear some doubts. Morevorer, I really like the way you get excited as soon you prove something cool. Thanks again!
You're awesome. I cannot explain how much I appreciate your fantastic job on this channel.
This is such a good video & so well explained! Love it, really helps with my understanding :) The part around 14:45 in particular is mind blowing & eye opening!
thank you so much for this explanation 😭😭 i finally understand
You're very welcome!
Much better than my professor's explanation!
I like your way of teaching TOC.
The last part was amazing
Really helpful!!! No update on the proving a language not regular? I have a good example from a book: let language B={(0^n)(1^n) | n>=0}
"DIRECT and EASY proof that 0^n 1^n is not regular - Easy Theory
"
After watching this video, I truly believe you will help me finish college!!
Wondering stuff, Ryan!
You are awesome, thank you for your effort.
Thank you very much
Gaurav Chaudhari you're welcome!
perfect
Thanks!
Thank you for this! awesome content. Would love to see how we can transform a FA into its minimum possible states from a state table. (Not sure what the name of these types of problems are called)
William Macleod I've already done it! It's not a highly viewed video on my channel but if you look for minimizing a DFA you can find it. (It uses the table method in disguise)
Thank you! Awesome explanation!
You're welcome!
thanks
This video is too long and not necessarily the clearest
Homie thinks math is fun. Videos are legit compared to the lectures my prof gives.
dude my professor lives in another world, he thinks we already took the course back in 1990