Language of Palindromic Strings is not Regular (Theory of Computing)
We prove in today's lecture that the language of palindromic strings is not regular. Note that I leave the even-length palindromes as an exercise to prove as not regular, but if you follow the proof and my tip it's a piece of cake!
Time Stamps:
0:00 Recap, what is a palindrome?
1:17 Proving the language of odd-length palindromes is not regular.
11:49 What about the even-length palindromes?
14:14 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
#pumpinglemma
#automatatheory