###### Research Aptitude

October 25, 2023###### Pumping-lemma

October 25, 2023# Pumping-Lemma

Question 1 |

A language L satisfies the Pumping Lemma for regular languages, and also the Pumping Lemma for context-free languages. Which of the following statements about L is TRUE?

L is necessarily a regular language | |

L is necessarily a context-free language, but not necessarily a regular language | |

L is necessarily a non-regular language | |

None of the above |

Question 1 Explanation:

As we know that pumping lemma is a negative test, which can be use to disprove the given language is not regular. But reverse is not True.

Correct Answer: D

Question 1 Explanation:

As we know that pumping lemma is a negative test, which can be use to disprove the given language is not regular. But reverse is not True.

Subscribe

Login

0 Comments