wiz-icon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

Consider the following statements:
I. There exists a non deterministic context free language whose reversal is DCFL.
II. There exists a non regular CSL whose Kleene closure is regular.
Which of the above statements are true ?

Open in App
Solution

I is true,
for example take L={an bn d}{an b2n d}.
It's reversal will be [Can bn] L {dan b2n] which is a DCFL. So, I is okay.

II is also true. lets take L={an|p is prime} If we take its kleene closure .
Then Ln=ϵaaa
Hence II is also correct.

Therefore (a) is the most appropriate choice

flag
Suggest Corrections
thumbs-up
0
similar_icon
Similar questions
View More
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Closure Properties of CFL Part - 2
OTHER
Watch in App
Join BYJU'S Learning Program
CrossIcon