PLEASE ANSWER THESE;

Exercise 2.9

Exercise 2.11

Exercise 2.14

AND THE LAST PDA DIAGRAM, TO FIND THE CFG

Find the CFG of the following PDA;

Find the CFG of the following PDA ABOVE.

.. Introduction-To-The-Theory-Of-Computation-Michael-Sipser .pdf-Adobe Acrobat Reader DC File Edit View Window Help Home Tools Introduction-To-Th..X Sign In 11896 2.9 Give a context-free grammar that generates the language ^ 2.10 Give an informal description of a pushdown automaton that recognizes the lan 2.11 Convert the CFG G4 given in Exercisc 2.1 to an equivalent PDA, g te proce 2.12 Convert the CFGG given in Exercise 2.3 to an equivalent PDA, using the procedure 2.13 Let G (V. . R, S) be the following grammar. V = { S. T, U): = {o. # }; and Is your grammar ambiguous? Why or why not? guage in Exerse 2.9 dure given in Theorem 2.20. given in Theorem 2.20. R is the set of rules: Export PDF Create PDF Edit PDF Comment Combine Files 0 Organize Pages Fill & Sign U-0U00 | # a. Describe L(G) English b. Prove that L(C) is not regular. Send for Signature 2.14 Convert the following CFG into an equivalent CFG in Chomsky normal form, -. Send & Track using the procedure given in Theorem 2.9 + More Tools 2.15 Give a counterexample to show that the following construction fails to prove that the class of context-free languages is closed under star. Let A be a CFL that is generated by the CFG G = (V.. R,S). Add the new rule S-SS and call the Store and share files in the Document Cloud ramin ar G. ,l'his graminar is supposed to generate A Learn More 2.16 Show that the class of context-free languages is closed under the regular operations, 9:12 PM O Type here to search 11/6/2017