Gate CS-2019 Question Paper With Solutions

Q. 24 For Σ = {a, b}, let us consider the regular language

L = {x ∣ x = a2 + 3k or x = b10 + 12k, k ≥ 0}

Which one of the following can be a pumping length (the constant guaranteed by the pumping lemma) for L?

(A) 3

(B) 5

(C) 9

(D) 24

Answer: (D)

Explanation:

Learn More:   Gate EC-2013 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here