Skip to content

Mod-15 Lec-01 Chomsky Hierarchy

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

Chomsky hierarchy of formal languages from regular to recursively enumerable. Summary lecture connecting automata, grammars, and computability.

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

Part of Mathematics - Formal Languages and Automata Theory