Question 7 10 pts Convert the following grammar into Greibach Normal Form (GNF): SbS | BCA AaA | BBa|c B → ba Upload Choose a File Question 9 10 pts Select all the statements below which are true: Each context-free language is accepted by some npda. Let {a, b, c}. The language = L= {anbncnn > 0} is a context- free language. ☐ npda's and dpda'a are equivalent. The language L= {wwwЄ {a, b}*} is accepted by some npda. A npda has at most one transition for any combination of input symbol and stack symbol. dpda's can have λ - transitions. Each regular language is accepted by some npda. A dpda M can contain the transitions 8 (a, c, a) = {(1,A)} and 8 (q,, a) = {(92, aa)}. Question 10 10 pts Draw a npda for the language: L = {can+2b(cb)":n≥ 0} Write the sequence of moves done by the npda for the input sequence w = caab. Is the string w accepted? Upload Choose a File Question 11 10 pts 1) (8 points) What is the language accepted by the npda below? 2) (2 points) Write the sequence of moves done by the npda for the input sequence w = abba. Is the string w accepted? 2.2.2 १० 91 a, z, 1z b. 1, 1 b, 1,2 a, 2, 3 c. 3, 2 BIUA 14pt × EE HTML Editor >> = = = Paragraph Question 12 10 pts Show that the language below is context- free: L= {w = {b, c}* : n₁ (w) = nc (w) and w has the length divisible by 3} Hint: use the closure under regular intersection property. BIU A ▾ A ▾ ¤; ‹ × [ ► 14pt HTML Editorg x = = = Paragraph