Question

Using the pumping constant n, If there is a string in the language of length between _____ and ____ then the language is infite else not.

(a) n, 2n-1

(b) 2n, n

(c) n+1, 3n+6

(d) 0, n+1

The question was posed to me during an online interview.

Asked question is from CFL- Closure Properties/Decision Properties topic in division Properties of Context Free Languages of Automata Theory

Answer 1

The correct answer is (a) n, 2n-1

Explanation: If there is a string in the language of length between n and 2n-1 then the language is infite else not. The idea is essentially the same for regular languages.