Question 1

Question 2

Question 3

The grammar of a regular language is given by: S-> T T->ATI TA What is the regular expression of this language ? a(ab) O (a+b)*a ab(a+b) a(a+b)* Which of the following regular expressions represents the set of all strings over {a,b) that always begins with a and ends with b a(a+b)*b a*b*b + a*b*a (ab+ a)* aa'b'b Which of the following is a part of the regular expression (ab + aa)* ? abaab abbab None of the given choices bbab