The Gateway to Computer Science Excellence
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 by Active (4.8k points) | 49 views

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.

1 Answer

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)
by Active (2.8k points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,297 answers
104,977 users