GATE CS 2019 — Question 37

Multiple choice 2 marks Question 37 2019

Question 37

MCQ 2 marks · −0.66 Theory of Computation

For \(\Sigma = \{a,b\}\), let us consider the regular language \(L = \{x \mid x = a^{2+3k}\) 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\)?

Answers and explanations are free — they just need an account.

Where this question comes from

Source: GATE 2019 Computer Science and Information Technology, Q37 (question number approximate)