Skip to content

Mod-01 Lec-15 Decision problems for regular languages.

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

Covers decidability of problems for regular languages, including emptiness and membership. Establishes computable properties of regular languages.

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

Part of Computer Science - Theory of Computation