For , let us consider the regular language . Which one of the following can be a pumping length (the constant guaranteed by the pumping lemma) for ?
- A3
- B5
- C9
- D24
Theory of Computation (TOC)Regular and Context-Free Languages & Pumping LemmaMCQ1 mark · −1/3 if wrongMedium
A GATE question every morning
One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.