What are Nondeterministic Finite Automata with Epsilon-Transitions? (Theory of Computing)

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


Duration: 27:09
12 views
2

What if we allow nondeterministic finite automata to transition without reading/consuming a symbol of the input string? That's where we are going, let's look at ε-NFAs.

Time Stamps:
0:00 Opening/Recap
2:14 Introduction of concept of ε-moves/transitions.
6:45 Example: Recognizing keywords
13:40 Example: Reading decimals
22:36 Definition of ε-NFA.
26:40 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
#theoryofcomputation
#automatatheory



Other Videos By PageWizard Games, Learning & Entertainment


2023-03-24Converting Regular Expressions to ε-NFAs - Thompson's Construction (Kleene's Theorem (Part 1))
2023-03-23Dan Plays Chrono Trigger (March 23, 2023 - Technical Issues)
2023-03-22Designing Regular Expressions [FULL EXAMPLES] (Theory of Computing)
2023-03-22Proving Languages are Not Regular (via Pumping Lemma)
2023-03-20What are Regular Expressions? (Theory of Computing)
2023-03-19Ms. Kitty Reacts to The Grapist
2023-03-17Lazy Subset Construction for ε-NFAs (Converting ε-NFAs to DFAs) [Theory of Computing]
2023-03-17Dan Plays Chrono Trigger (March 16, 2023)
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)


Tags:
Computer Science
Algorithms
Data Structures
Education
CompSci
CS
PageWizard
Mathematics
Accessibility
University
COMPSCI
COMP
CSCI
Western
Manitoba
StFX
Regina
theory of computing
automata theory
epsilon transition
epsilon
free moves
NFA
DFA