ace toc 1

Question

Answer 1

I am not sure, But I am gonna go with

D. Recursive.

L1,L2: CSL

L3: CFL

L=L1.L2-L3

= L1.L2 intersect L3'

=CSL.CSL intersect CFL'

=CSL.CSL intersect Recursive

= CSL.Recursive (not sure about this step)

=Recursive.

Comments

but i think every csl is recursive but every recursive is not csl right?

so yar i think CSL is answer.

---

But here we are concatenating it with recursive language.

Consider this:

If u are having a csl followed by a RL for analysis of csl we need a LPDA and for RL a Turing machine. No matter what, we need to analyse both languages.

Therefore we need (LPDA)U(TM)

And since TM can also analyse CSL therefore LPDA can be considered a subset of TM.

Thats why I THINK the answer is Recursive.

---

But here we are concatenating it with recursive language.?

i think we are intersecting it ...check again