Q1. Construct an NFA and a DFA for recognizing the language denoted by the regular expression aa* + bb*
Q2. Write regular expressions for the following languages over the alphabet {0, 1}:
a) The set of all strings that begin with 110.
b) The set of all strings that contain 1011.
c) The set of strings of 0's and 1's with at most one pair of consecutive 1's.
Q3. Write regular expressions for the following languages over the alphabet {a, b}:
a) The set of strings containing at least one a and at least one b .
Q4. Convert the following regular expressions to NFA's with ε -transitions.
