Can intersection of non-context-free languages be context-free? For two languages over the same alphabet that are not context-free, can their intersection be context-free, Or does at least one of them have to be context-free?
Let $L$ be an arbitrary language. Then
$$ \{ 0x : x \in L \} \cap \{ 1x : x \in L \} = \emptyset. $$