Prove that the class of context-free languages is closed under the concatenation operation
computer science
Description
Question 1
Prove that the class of context-free languages is closed under the concatenation operation
Question 2
Prove that the class of context-free languages is closed under the Kleene star operation
Question 3
Consider the language L= {aibjck| i, j, k≥0, and if i=1 then j=k}
1. Show that L is not regular. Hint: the regular languages are closed under the intersection operation.
2. Show that L meets the requirements of the regular language pumping lemma. In other words, find a pumping length n and show that the conditions hold for strings longer than n.
3. Explain why the previous two parts do not contradict each other
