0

I am trying to find a proof of A ∩ B where A is a CSL and B is a CFL. Also I know that CFL is a strict subset of CSL. Does that mean that their intersection will give CFL. I am stuck

glitch_123
  • 5
  • 2

1 Answers1

1

In the general case, the intersection between a context-sensitive language and a context-free language is context-sensitive.

See this post for details.

Nathaniel
  • 18,309
  • 2
  • 30
  • 58