Please wait...
THANKU FOR BEING A PART OF OUR JOURNEY TO BRING "REVOLUTION IN EDUCATION"
We Genuinely APPRECIATE your PATIENCE

25
M: +1.00/-0.33

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?

[GATE CS 2019]
A
B
C
D