Nondeterminism and Nondeterministic Finite Automata

Channel:
Canada PageWizard Games, Learning & Entertainment
Subscribers:
780
Published on ● Video Link: https://www.youtube.com/watch?v=jwnH6rl-Zng


Duration: 3:45:19
17 views
3

We continue our adventures studying Automata Theory and Formal Languages together. Previously we explored deterministic finite automata. We try to see what happens if we "buff" up our DFA by introducing another concept, nondeterminism. We learn what that is about, what a nondeterministic finite automaton is, design some of these machines, and if we have time, prove one is correct!

Time Stamps:
0:00 Preshow (Ms. Kitty raids the lecture)
28:10 Lecture begins

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!):
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

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

#automatatheory
#computerscience
#theoryofcomputing



Other Videos By PageWizard Games, Learning & Entertainment


2023-02-13The Binomial Theorem (Mathematics for Computer Science)
2023-02-10Dan Plays Monster Hunter Rise: Sunbreak (February 9, 2023)
2023-02-10Properties of Pascal's Triangle (Mathematics for Computer Science)
2023-02-08Pascal's Triangle and Formula (Mathematics for Computer Science)
2023-02-08Equivalence of Deterministic and Nondeterministic Finite Automata
2023-02-06n Choose k Equals n Choose n-k
2023-02-03Dan Plays Pokemon Scarlet (FINALE - Feb. 2, 2023)
2023-02-03Proving Correctness of DFAs via State Invariants II [FULL EXAMPLE 2] (Theory of Computing)
2023-02-01Ms. Kitty Disrupts Dr. Page's Lecture All Wet
2023-02-01Proving Correctness of DFAs via State Invariants [FULL EXAMPLE] (Theory of Computing)
2023-02-01Nondeterminism and Nondeterministic Finite Automata
2023-01-30Proving Correctness of Deterministic Finite Automata, State Invariants (Theory of Computing)
2023-01-27Formal Definition of Computing for DFAs (Theory of Computing)
2023-01-25Regular Operators (Theory of Computing)
2023-01-23Designing Deterministic Finite Automata (DFAs) [Theory of Computing]
2023-01-20What are Deterministic Finite Automata (DFAs)? A Conceptual Overview [Theory of Computing]
2023-01-19Dan Plays Pokemon Scarlet (January 19, 2023)
2023-01-18What is a Formal Language? Decision Problems and Discussion [Theory of Computing]
2023-01-12Dan Plays Pokemon Scarlet (January 12, 2023)
2023-01-11Combinations (k-Combinations) [Mathematics for Computer Science]
2023-01-10Deterministic Finite Automata: Regular Operators, and Proving DFAs are Correct


Tags:
theory of computation
tcs
computer science