NPTEL Video Course : Theory of Computation
Lecture 12 - Construction of a regular expression for a language given a DFA accepting it. Algebraic closure properies of regular languages
Home
Previous
Next
Thumbnails