MCQ
Q.
Which of the following is not an application of Pumping Lemma?
Correct Answer: D
None of the mentioned are regular language and are an application to the technique Pumping Lemma. Each one of the mentioned can be proved non regular using the steps in Pumping lemma.