Algebraic Laws of Regular Expressions and More! (Theory of Computing)
4Finally we address those closure properties of regular operators and how you might go about proving those (it's nice and easy once you have Kleene's Theorem). Then, we discuss some algebraic properties of regular expressions and their corresponding regular languages.
Note: There may be some video artifacts in this lesson, this happened due to the capturing hardware potentially. I apologize for this.
Time Stamps:
0:00 Recap and setup
1:30 Closure properties of regular operators and the proof idea of each, via Kleene's Theorem.
2:07 Algebraic laws for Regular Expressions
16:28 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: https://www.patreon.com/PageWizard
SUBSCRIBESTAR: https://www.subscribestar.com/drpage
PAYPAL: https://paypal.me/pagewizard
Follow also at:
FACEBOOK: https://www.facebook.com/DanielRPage
TWITTER: https://twitter.com/PageWizardGLE
QUORA: https://www.quora.com/profile/Daniel-R-Page
TWITCH: https://www.twitch.tv/pagewizard
#ComputerScience
#theoryofcomputation
#regex