Regular Language and Finite Automata|| (2 Mark)||MCQ||2019

Last Updated :
Discuss
Comments

For Σ = {a,b}, let us consider the regular language L = {x|x = a 2+3k or x = b 10+12k , k ≥ 0}. Which one of the following can be a pumping length (the constant guaranteed by the pumping lemma) for L?

[GATE 2019|| MCQ|| 2-mark]


3

9

5

24

This question is part of this quiz :

GATE||Regular Language and Finite Automata|| Pyq (2010 to2025),GATE||TOC || Pyq (2010 to2025)
Tags:
GATE CS
Theory of Computation
GATE CS
Share your thoughts in the comments
Article Tags :