Show that the language L ai bj ck i j greaterthanorequalto
Show that the language L = {a^i b^j c^k: i, j greaterthanorequalto 0, k = i + j} over the alphabet Sigma = {a, b, c} is context free by giving a CFG for the language.
Solution
Answer:
Yes , it is context free since to push a and b\'s and pop with c\'s . We can draw PDA for it. The CFG for this language is :
S--->AB
A--->aAb
B--->b
