Language with Prime-Length Strings is not Regular [using Pumping Lemma] (Theory of Computing)

We explore a trickier example today for proving a language is not regular. We use the pumping lemma and contradiction to prove that the language of unary strings with prime length is not regular.

Time Stamps:
0:00 What we are going to prove! Tips.
1:32 Proof
15:36 Closing

Have a beautiful day!

Supporters (to date of publication, by tier (top to bottom)):
----------------------------------------------------------
Patreon Supporters (General Support):
Draikou
Patreon Supporters (Basic Support):
Eric R
Patreon Supporters (Supporter Access!):

-----------------------------------------------------------
Become a supporter today! To support my work and mission to provide free or accessible Computer Science education (especially in theory), subscribe to the channel, share my videos. Please donate and contribute to support my work for more content:
PATREON:   / pagewizard  
SUBSCRIBESTAR: https://www.subscribestar.com/drpage
PAYPAL: https://paypal.me/pagewizard

Follow also at:
FACEBOOK:   / danielrpage  
TWITTER:   / pagewizardgle  
QUORA: https://www.quora.com/profile/Daniel-...
TWITCH:   / pagewizard  

#ComputerScience
#automata
#tcs