GATE Computer Science (CS) 2019 Solved Papers
© examsiri.com
Question : 25 of 65
Marks:
+1,
-0
For , let us consider the regular language or Which one of the following can be a pumping length (the constant guaranteed by the pumping lemma) for ?
Go to Question: