Q. 1 Maximum score 20 Find a regular expression corresponding to the language of all strings not containing the substring aaa for the alphabet {a,b}*

Q. 2 Maximum score 40 (15 points for part (a) and 25 points for part (b)

Consider the following grammar {N = (S,T,U,V,W), T = {a, b, c}, Starting state S, and production rules}

STU|V

TaTb|

UcU|

VaVc|W

WbW|

1. What is the language generated by this grammar?
2. Convert the grammar to Chomsky Normal form (CNF){ Hint: You can remove all the -production rules in one-step and same way you can remove all unit production rules in one step}