Multiple Choice 11) Given the Language L = {ab, aa, baa), which of the following strings is in L*? a) abaabaaabaa b) abba c) babaababba d) aababbbaa 12) Which one of the following languages over the alphabet {0,1} is described by the regular expression: (0+1)*0(0+1)*0(0+1)* ? a) The set of all strings containing at most two 0's b) The set of all strings containing the substring 00 c) The set of all strings that begin and end with either 0 or 1 d) The set of all strings containing at least two 0's 13) Number of DFA states required to accept a string ending in 101 a) 1 b) 5 c) 4 d) 2 e) 7 f) 10 14) The generators of Languages are a) Regular Expressions b) Grammars c) FSM d) All of the Above 15) A grammar is said to be an ambiguous grammar if it a) Produces more than one Derivation Tree b) Produces more than one left most Derivation Tree c) Produces more than one right most Derivation Tree d) All of the Above