259 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.

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

1 votes
1 votes
3 answers
2
1 votes
1 votes
1 answer
3
Souvik33 asked Dec 4, 2022
332 views
Consider the following statementS: $\left \{ a^{n}b^{n+k}|n\geq 0,k\geq 1 \right \} \cup \left \{a^{n+k}b^{n}|n\geq 0,k\geq 3 \right \}$ is DCFLThe above statement is:TRU...
0 votes
0 votes
0 answers
4