Q7. Provide at least two basic differences between deterministic and nondeterministic finite automata? Q8. Which one of the options is the regular expression for the following NFA construction? M M 2 (a)r= (a + bb)* (ba* + 1) (b)r= (a + bb)* 1* (ba*1 + 1) (c)r= (a + bb) (ba* +1) (a)r = (a + bb)* (b + 1)* (d) None of the above 09. Consider the following grammar: V = {S, A, B }, T = { a, b }, and productions SAAB A Bb B A12 (a) Show leftmost and rightmost derivations of the string abb? (b) Draw the parse trees for the two derivations in (a) and interpret the results. Q10. (a) Give a simple expression for the language L(G) generated by the grammar with production rules: S + aaaA, A bbs, S + .. (b) Find three strings in the above language: Q11. (a) Draw the NFA for the following transitions: 8(qo, 0) = { qo, q} 8(qo, 1) = { q} 8(q1, 0) = { 22} 8(q1, 1) = {q2} d(02, 0) = 8(42, 1) = { q2} (b) Convert the NFA transitions to DFA transitions and draw the DFA automata