Pumping Lemma for Regular Languages Example: Perfect Squares

Pubblicato il: 26 luglio 2021
sul canale di: 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.

In questa pagina del sito puoi guardare il video online Pumping Lemma for Regular Languages Example: Perfect Squares della durata di ore minuti seconda in buona qualità , che l'utente ha caricato Easy Theory 26 luglio 2021, condividi il link con amici e conoscenti, su youtube questo video è già stato visto 3,733 volte e gli è piaciuto 63 spettatori. Buona visione!

303