subject computing theory

a) Determine the list of production rules for the Context Free Grammar that can produce palindromes of = {a,b}.

b) Prove that the CFG written above can produce the string ababa using the CYK (Cocke Younger and Kasami) Algorithm.

c) Draw and explain the working of a Push Down Automata that accepts strings of the pattern aⁿb²ⁿc³ⁿ = {a,b}, n>=1.