Paper 1, Section I, G
(a) State the pumping lemma for context-free languages (CFLs).
(b) Which of the following are CFLs? Justify your answers.
(i)
(ii) and
(iii)
(c) Let be a CFL. Show that is also a CFL.
Typos? Please submit corrections to this page on GitHub.