Formal Definition of Computing for DFAs (Theory of Computing)
2Previously we learned how a deterministic finite automaton (DFA) works at a higher level, now we will learn how it formally works using the concept of an extended transition function! With this, we can define the language of a DFA.
Time Stamps:
0:00 Recap of how DFAs work at a higher level, as discussed before.
1:10 Formal Definition of Computing for a DFA (promise about this definition)
4:00 Extended transition function, full examples
25:10 Language of a DFA
28: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):
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
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
#automata