Applying Kleene's DFA to Regex Construction (Theory of Computing)
2Today we see a full example of building a regular expression from a deterministic finite automaton via Kleene's construction/algorithm!
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 remarks about Kleene's Construction
1:13 Example (full example, k=0,1,2)
29:50 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