Introduction to Non-Deterministic Finite Automata (NFA)
12,265 views
Why it's on BrighterTube
Hand-picked by a BrighterTube curator · found via Reddit r/compsci thread: Any recommendations of youtube channels for programming and computer science stuff? · 80% confidenceDefines the nondeterministic finite automaton formally (the five-tuple and a transition function into sets of states) and traces how an NFA accepts a string by exploring several paths at once. From Neso Academy's methodical theory-of-computation playlist.
What you'll learn
Introduces non-deterministic finite automata: definition, transition function and how they accept strings.
Video by Neso Academy, played through YouTube's embedded player.
Part of Finite Automata | Chapter 2 | Theory of Computation (TOC), Theory of Computation (TOC)
Go deeper
As an Amazon Associate, BrighterTube earns from qualifying purchases. Picked by hand for this subject; nobody paid to be listed.