Pumping Lemma for Regular Languages Example: 0^n 1^m (n is less than 3m)
Here we show that the language of all strings of the form 0^n 1^m where n is strictly less than 3m is not regular. This is a standard pumping lemma proof, other than picking the right string at the beginning!
Easy Theory Website: https://www.easytheory.org
Discord: / discord
If you like this content, please consider subscribing to my channel: / @easytheory
▶SEND ME THEORY QUESTIONS◀
[email protected]
▶ABOUT ME◀
I am a professor of Computer Science, and am passionate about CS theory. I have taught many courses at several different universities, including several sections of undergraduate and graduate theory-level classes.