Subset Construction: NFAs to DFAs (Theory of Computing)

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


Duration: 41:45
18 views
2

Now that we have studied more about nondeterminism and nondeterministic finite automata, we try to answer a fundamental question about NFAs: Do they recognize more languages than DFAs? We see a procedure that allows us to take any NFA and build a DFA that recognizes the same language. We haven't proven this construction is correct yet, but this will summarize how to carry out the subset construction!

Time Stamps:
0:00 Opening
5:45 Subset/powerset construction for NFAs
22:19 Example applying the subset construction to a NFA, additional comments
41:24 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
#theoryofcomputing
#automata



Other Videos By PageWizard Games, Learning & Entertainment


2023-03-15How Do ε-NFAs Work? ε-Closures & More! (Theory of Computing)
2023-03-15Introduction to Cryptography
2023-03-13What are Nondeterministic Finite Automata with Epsilon-Transitions? (Theory of Computing)
2023-03-10Equivalence of Nondeterministic and Deterministic Finite Automata (Theory of Computing)
2023-03-10Dan Plays Chrono Trigger (March 9, 2023)
2023-03-08Proving the Correctness of the Subset Construction (Theory of Computing)
2023-03-07Pumping Lemma for Regular Languages (Birthday Stream)
2023-03-06Applying the Lazy Subset Construction for NFAs (to DFAs) [Theory of Computing]
2023-03-03Lazy Subset Construction (for NFAs to DFAs) [Theory of Computing]
2023-03-03Dan Plays Chrono Trigger (March 2, 2023)
2023-03-01Subset Construction: NFAs to DFAs (Theory of Computing)
2023-03-01Regular Expressions II (Regex to DFA - Kleene's Theorem (Part 2))
2023-02-27Proving NFAs are Correct via State Invariants (Theory of Computing)
2023-02-24Designing Nondeterministic Finite Automata (Theory of Computing)
2023-02-24Dan Plays Chrono Trigger (February 23, 2023)
2023-02-22Formal Definition of Computing for NFAs (Theory of Computing)
2023-02-22Regular Expressions I
2023-02-20What are Nondeterministic Finite Automata? [Theory of Computing]
2023-02-17Dan Plays Chrono Trigger (February 16, 2023)
2023-02-17Rows of Pascal's Triangle Sum to Powers of 2 (Mathematics for Computer Science)
2023-02-15Applying the Binomial Theorem (Mathematics for Computer Science)


Tags:
Computer Science
Algorithms
Data Structures
Education
CompSci
CS
PageWizard
Mathematics
Accessibility
University
COMPSCI
COMP
CSCI
Western
Manitoba
StFX
Regina
nfa
dfa
powerset construction
subset construction
rabin
scott
subset
finite automata
automata
theory