Vani institute question bank

Question

5. For n ≥ 0, Ln = {a^i b^k  |  i ≥ n, 0 < k < i}  
(a) Ln is regular, independent of value of n

(b) Ln is not regular, independent of value of n

(c) Ln is regular only for small value of n

(d) None of above

Comments

is the answer b?

---

Yes, but how can it be independent of n? As number of a must be greater than equal to number of n..!

Answer 1

Here, the question is not about if the language is dependent on $n$ or not.

It is asking if it is regular or not.
The answer to that is: no it is not regular.

The next question it asks is,

Does being regular or non-regular depend on $n$?
The answer is: no, it is independent ie let $n$ be whatever, the language remains to be non-regular.

Comments

Thanks man.. :)

Now please help me in that merge sort  question :)