0 votes 0 votes For an unrestricted grammar $G$, show that the question $“Is \space L(G) = L(G)^*?”$ is undecidable. Argue $\text(a)$ from Rice’s theorem and $\text(b)$ from first principles. Theory of Computation peter-linz peter-linz-edition5 theory-of-computation decidability proof + – Rishi yadav asked Mar 16, 2019 Rishi yadav 193 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.