Lecture 21: Intersection operation on Regular Languages.

Proof of regular languages are closed under Intersection.
simplified method to find intersection problems on regular languages.
Examples of intersection for the following languages:
1. Design a DFA over {0,1} that accept all string having at least two 0's and atmost one 1's.
2.  Design a DFA over {0,1} that accept all string that starts with 0 and end with 0.