0 votes 0 votes Let $G_1$ and $G_2$ be grammars with $G_1$ regular. Is the problem $L(G_1) = L(G_2)$ decidable when $\text(a)$ $G_2$ is unrestricted, $\text(b)$ when $G_2$ is context-free, $\text(c)$ when $G_2$ is regular$?$ Theory of Computation peter-linz peter-linz-edition5 theory-of-computation decidability proof difficult + – Rishi yadav asked Mar 16, 2019 Rishi yadav 289 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes (c) When G2 is regular. Given G2 as Context free or Unrestricted, determining whether it will be regular is undecidable problem. Sumiran Agrawal answered Jun 24, 2019 Sumiran Agrawal comment Share Follow See all 0 reply Please log in or register to add a comment.