Skip to content

Mod-01 Lec-12 Construction of a regular expression for a language given a DFA accepting it.

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

Demonstrates conversion from DFA to equivalent regular expression. Shows bidirectional relationship between automata and regular expressions.

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

Part of Computer Science - Theory of Computation