Pumping Lemma for Regular Languages Example: Perfect Squares

Publicado el: 26 julio 2021
en el canal de: 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.

En esta página del sitio puede ver el video en línea Pumping Lemma for Regular Languages Example: Perfect Squares de Duración hora minuto segunda en buena calidad , que subió el usuario Easy Theory 26 julio 2021, comparta el enlace con amigos y conocidos, en youtube este video ya ha sido visto 3,733 veces y le gustó 63 a los espectadores. Disfruta viendo!

55,998