in Theory of Computation
160 views
0 votes
0 votes

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

in Theory of Computation
160 views

2 Comments

we can write this in terms of regular expressions

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

4
4
Hmm, nice approach.
0
0

1 Answer

0 votes
0 votes
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)

Related questions