Pumping Lemma for Regular Languages Example: Perfect Squares

Publicado em: 26 Julho 2021
no 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.

Nesta página do site você pode assistir ao vídeo on-line Pumping Lemma for Regular Languages Example: Perfect Squares duração hora minuto segundo em boa qualidade , que foi baixado pelo usuário Easy Theory 26 Julho 2021, compartilhe o link com seus amigos e conhecidos, no youtube este vídeo já foi visto 3,733 vezes e gostou 63 espectadores. Boa visualização!

1,220