Today we will continue studying Deterministic Finite Automata. Before we continue, I'll introduce what regular operators are, then we will now exactly what "computing" is on a deterministic finite automaton (DFA). We will dedicate (and use this definition) a good portion of today's lecture to proving DFA we previously studied are correct.
Time Stamps:
0:00 Preshow
1:07:00 Lecture begins.
Supporters (to date of publication, by tier (top to bottom)):
----------------------------------------------------------
Patreon Supporters (General Support):
Draikou
Patreon Supporters (Basic Support):
Patreon Supporters (Supporter Access!):
Eric R
-----------------------------------------------------------
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
0