0 votes 0 votes Let $G_1$ be an unrestricted grammar, and $G_2$ any regular grammar. Show that the problem $L(G_1) \space\cap L(G_2) = \phi $ is undecidable. Theory of Computation peter-linz peter-linz-edition5 theory-of-computation decidability proof + – Rishi yadav asked Mar 16, 2019 Rishi yadav 200 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.