0 votes 0 votes Show that for arbitrary context-free grammars $G_1$ and $G_2$, the problem $”L(G_1) \space\cap L(G_2) $ is context-free$”$ is undecidable. Theory of Computation peter-linz peter-linz-edition5 theory-of-computation decidability proof difficult + – Rishi yadav asked Mar 16, 2019 Rishi yadav 148 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.