Pumping Lemma for Regular Languages Example: Perfect Squares

Published: 26 July 2021
on channel: Easy Theory

3,733

Here we show that the set of strings that represent perfect squares is not regular by using the pumping lemma for regular languages. The "trick" here is to look at the resulting string length and show that it can only be between two consecutive perfect squares, and not equal to either of them.

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.

On this page of the site you can watch the video online Pumping Lemma for Regular Languages Example: Perfect Squares with a duration of hours minute second in good quality, which was uploaded by the user Easy Theory 26 July 2021, share the link with friends and acquaintances, this video has already been watched 3,733 times on youtube and it was liked by 63 viewers. Enjoy your viewing!

15,153

457