Virtual gate

Question

Answer 1

It's a property of Context Free Languages. Same is given in the Peterlinz's book.
I mean, CFL is closed under right quotient operation with Regular language.

As shown in the below example by Rahul

L = {a^n b^n  | n>0 }

R ={a^n  | n>0}

Here L/R is Φ which is regular as well as CFL, hence option B is false.

Comments

@Manu Bhai

L = {a^n b^n  | n>0 }

R ={a^n  | n>0}

I think here L/R is Φ which is regular as well as CFL then option B is false

---

@akash

I think, you're right. L/R  will be empty language in this case because for no strings in L1 has suffix from L2.

B is false as you said.