Skip to content

Mod-01 Lec-03 Finite automata continued, deterministic finite automata(DFAs),

nptelhrd2.25M subscribers

About this video

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

Continues finite automata theory with deterministic finite automata (DFAs). Teaches construction and properties of DFA models for language recognition.

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

Part of Computer Science - Theory of Computation