Please help with my homework

Theory of Computation

Problem 4. For each of the following context-free grammars, use set notation(pattern/rule) to define the language generated by the grammar: Grammar L(G) S aaSB 2 B Bb S aSbb | A 2 A CA|c S aSbA A AdcBd B aBb | ab Problem 5. Write a corresponding CFG for the following languages where = {a,b}. a) L = {a^wb":w {a,b}*,N >0} b) L = {wb: w E {a,b}*} c) L = {all strings in {a,b}* where the number of a's is odd} 90 91 3 Problem 6. Convert the following Finite Automata to Regular Grammar: 92