1) Convert εNFA to DFA and corresponding εNFA iff DFA theorem.
2) Demonstrate by induction theorem with suitable ex.
3) What do you mean by a regular expression?
4) prepare down the difference between L* and L+.
5) prepare a r.e to denote the language L that accepts all strings that begin or end with either 00 or 11.
6) Create a r.e for language over the set _= {a,b} in which total number of a’s are divisible by 3.
7) What do you mean by:
(i) (0+1)*
(ii) (01)*
(iii) (0+1)
(iv) (0+1)+
8) prepare down the applications of pumping lemma? And define the theorem.
9) describe the closure property of regular sets with suitable ex.
10) Reg exp for language such that each string will have at least one ‘a’ followed by at least one ‘b’.
11) Let R be any set of regular languages. Is UR regular? Verify it.
12) Illustrate that (r*)*=r*