Reversal of a Regular Language is Regular (Theory of Computing)
We explore the operation of reversing a string in today's lecture. We see whether a regular language stays regular if all its strings are reversed!
Time Stamps:
0:00 Opening
0:15 Reversal of a string, reversal of a language
3:23 Constructing a NFA with epsilon-transitions that recognizes the reversal of a regular language.
11:43 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
#theoryofcomputation