Nondeterministic Finite Automata with Epsilon-Transitions
Today we explore more about nondeterministic finite automata (NFAs)! Let's see if we add more features to a NFA, that we can recognize more languages? Either way, it will help give more features for designing finite automata!
Time Stamps:
0:00 Preshow
13:53 Lecture
Fill out our form to learn more when we can help you learn computer science together live: https://forms.gle/ergL8FrbHuAHctF3A
Supporters (to date of publication, by tier (top to bottom)):
----------------------------------------------------------
Patreon Supporters (General Support):
Draikou
Patreon Supporters (Basic Support):
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
Follow also at:
FACEBOOK: https://www.facebook.com/DanielRPage
TWITTER: https://twitter.com/PageWizardGLE
QUORA: https://www.quora.com/profile/Daniel-...
TWITCH: https://www.twitch.tv/pagewizard
#computerscience
#automata
#theoryofcomputation