Given the CFG below:  E → E + T | T  T → T x F | F  F → ( E ) | a  Give BOTH parse tree and derivations for each strings. A. a  B. a x a x a + b C. ( ( a ) )  D. a + a

Convert the following Grammar to Chomsky normal form, upload a docx of your solution:   S → aS |  Sb   |  bT | U T → Ta | cUc  | V  | null U → aUa | S  |  null V → dV | d   Please only provide the normal form :

Q39. Draw the transition diagrams for the following strings, (a) bbbb, babbb and babaa (b) construct, consequent, sequent (c) (a/b)* b (a/b)* a (a/b).

Prove that the following languages are not regular using the Pumping lemma and/or closure properties. Note: Do not use other methods. a. L1 = {w ∈ {a, b}∗: na(w) + nb(w) = 3 · nb(w)} (na (w) is used to denote the number of a's in the string w) b. L2 = {anbmck: n, m, k ∈ ℕ, n < m or n < k}