Skip to content

Mod-01 Lec-16 About minimization of states of DFAs. Myhill-Nerode theorem.

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

Explains DFA state minimization and the Myhill-Nerode theorem. Teaches methods for reducing automaton complexity while preserving language recognition.

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

Part of Computer Science - Theory of Computation