Introduction to ε-NFA

7,861 views

About this video

Intro · Hand-picked by a BrighterTube curator · found via Reddit r/compsci thread: Any recommendations of youtube channels for programming and computer science stuff? · 80% confidence

Introduces ε-NFAs, automata that can change state without reading input, and computes ε-closures on worked examples; precise, exam-oriented theory-of-computation teaching.

ε-NFAs: automata with empty transitions and ε-closure.

Video by Neso Academy, played through YouTube's embedded player.

Part of Finite Automata | Chapter 2 | Theory of Computation (TOC), Theory of Computation (TOC)