160 views

Though n is finite, how we will compare a and c. My answer is D, but C is provided as the answer.

we can write this in terms of regular expressions

like a1b+c1 + a2b+c2 +.............+ a99b+c99  , this is finite, So it should be regular

Hmm, nice approach.

If there would have been no upper bound on $n$, then $L$ would be context free. Here there is an upper bound to $n$ and therefore our language here is finite. All finite languages are regular. Also, all regular languages are context free.

Therefore given language is regular and context free. Ans is (C)

1
120 views
2
129 views
3
107 views
1 vote