Mod-01 Lec-08 Formal description of NFA, language accepted by NFA, such languages are also regular.

About this video

Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidence

Covers formal NFA definition, language acceptance by nondeterministic automata, and regularity proofs. Core automata theory with formal definitions and reasoning.

A 55-minute video from nptelhrd: “Mod-01 Lec-08 Formal description of NFA, language accepted by NFA, such languages are also regular.”.

Video by nptelhrd, played through YouTube's embedded player.

Part of Computer Science - Theory of Computation