Artificial-Intelligence
April 12, 2025
NTA UGC NET Dec 2024 Paper-2
April 13, 2025
Artificial-Intelligence
April 12, 2025
NTA UGC NET Dec 2024 Paper-2
April 13, 2025

NTA UGC NET Dec 2024 Paper-2

Question 9
Which of the following is TRUE about the Pumping Lemma for regular language?
A
It applies to all regular language
B
It applies only to infinite regular languages
C
It applies to all context – free languages
D
It applies to all recursively enumerable languages
theory-of-computationPumping-Lemma
Correct Answer: A
Govind Kumar

Leave a Reply

Your email address will not be published. Required fields are marked *