Exercise1

Exercise2

Exercise3

Activities " Image Viewer 11:31 200% Screenshot from 2018-11-03 11-30-02.png we use the following notation for a string w E : I wla . the number of o's in w, Exercise 1: Show that L-(wc wE(a, b' and k IwI is context free by: Giving the state diagram of as simple a PDA as possible that recognizes L a. b. Giving as simple a CFG as possible that generates L. Give a brief explanation Exercise 2: Given the grammar G with rules R =S as I asbs I a) What is the language generated by this grammar? b) Show that 6 is ambiguous. c) Convert G to an equivalent grammar in Chomsky Normal Form. Exercise 3: Which of the following languages are context-free? If it is context free, give a CFG (as simple as possible) that generates it, and a PDA (as simple as possible) that recognizes it. If it is not, prove your answer using the Pumping Lemma a) L-laww'a:n>0,we (a, b)) b) L-abab: n,j20)