This is a question from my first Theory of Computing practice homework assignment included as an image. I need help with all three parts (a,b, and c) if possible.
0, k > 0 b) Give a context-free grammar that generates a'b*c | i 2 0, k 2 0,j 2* (ki)}. c) Give a context-free grammar that generates the set of all well formed parentheses. The alphabet contains two symbols, namely "(" and ")". The following strings of length 6 are well formed parentheses: 0, (00), O(0), (0)0, ((()). But the following are not: ))(, ()(. This question requires some careful thinking "/>
Extracted text: a) Give a context-free grammar that generates amb"akb" | n 2 0, m > 0, k > 0 b) Give a context-free grammar that generates a'b*c | i 2 0, k 2 0,j 2* (ki)}. c) Give a context-free grammar that generates the set of all well formed parentheses. The alphabet contains two symbols, namely "(" and ")". The following strings of length 6 are well formed parentheses: 0, (00), O(0), (0)0, ((()). But the following are not: ))(, ()(. This question requires some careful thinking