10 marks Problem 5* For languages A and B over , define the language A + B as follows: A:B = {w E I* : there exists x B such that wx A} Show that if A is context-free and B is regular, then A + B is context-free. Problem 4 10 marks Let E = {0,1,#}. Is the following language regular; context-free but not regular; or not context-free? Justify your answer {x#y: x,y {0,1}* and bin(x) +1 = bin (rev(y))} 10 marks Problem 5* For languages A and B over 2, define the language A + B as follows: A = B = {w E L* : there exists x B such that wx A} Show that if A is context-free and B is regular, then A = B is context-free. 10 marks Problem 5* For languages A and B over , define the language A + B as follows: A:B = {w E I* : there exists x B such that wx A} Show that if A is context-free and B is regular, then A + B is context-free. Problem 4 10 marks Let E = {0,1,#}. Is the following language regular; context-free but not regular; or not context-free? Justify your answer {x#y: x,y {0,1}* and bin(x) +1 = bin (rev(y))} 10 marks Problem 5* For languages A and B over 2, define the language A + B as follows: A = B = {w E L* : there exists x B such that wx A} Show that if A is context-free and B is regular, then A = B is context-free