GATE CS 2019 (Forenoon) — Question 25

Theory of Computation (TOC)Regular and Context-Free Languages & Pumping LemmaMCQ1 mark · −1/3 if wrongMedium

For \( \Sigma = \{a, b\} \), let us consider the regular language \( L = \{x \mid x = a^{2+3k} \text{ or } x = b^{10+12k}, k \ge 0\} \). Which one of the following can be a pumping length (the constant guaranteed by the pumping lemma) for \( L \)?
  1. A
    3
  2. B
    5
  3. C
    9
  4. D
    24
Practise the full 2019-FN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAWhat rank do your marks get?GATE score, likely All-India Rank and qualifying marks for your category.
Practise more on Regular and Context-Free Languages & Pumping LemmaTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group