Paper 1, Section I, G

Automata and Formal Languages | Part II, 2018

(a) State the pumping lemma for context-free languages (CFLs).

(b) Which of the following are CFLs? Justify your answers.

(i) {www{a,b,c}}\left\{w w \mid w \in\{a, b, c\}^{*}\right\}

(ii) {ambnckdl3m=4n\left\{a^{m} b^{n} c^{k} d^{l} \mid 3 m=4 n\right. and 2k=5l}\left.2 k=5 l\right\}

(iii) {a3nn0}\left\{a^{3^{n}} \mid n \geqslant 0\right\}

(c) Let LL be a CFL. Show that LL^{*} is also a CFL.

Typos? Please submit corrections to this page on GitHub.