Assignment 4 (6 pts)Convert the following CFG into an equivalent CFG in Chomsky normal form. B→00| (6 pts)Use the pumping lemma to prove that the language A = {02n 13n 0n | n ≥ 0} is not context fre
Assignment 4 1. (6 pts) Convert the following CFG into an equivalent CFG in Chomsky normal form . A → BAB | ABA | B | B → 00 | 2. (6 pts) Use the pumping lemma to prove that the language A = {0 2n 1 3n 0 n | n ≥ 0} is not context free.3. ( 8 pts ) Construct a Turing machine that accepts the complement of the language L = L (aaaa * b * ).
4. ( 5 pts ) What language is accepted by the Turing machine whose transaction graph is in the fgure below?
Note: Submit your answers to BlackBoard . No hard copies.
