Let $L=L_1∩L_2$, where $L_1$ and $L_2$ are languages as defined below:
Then $L$ is
- Not recursive
- Context free but not regular
- Recursively enumerable but not context free.
My attempt :
$L_1$ is CSL(context sensitive language) and $L_2$ is regular . The intersection of both languages should be CFL(context free language), and
Can you explain little bit please ?