CS301 - Theory of Computation - L20

This lecture discusses closure properties of Regular Languages and establishes that Regular Languages are closed under String Reversal, Complementation, Concatenation and Kleene Iteration.