200 views
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.

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
Rishi yadav asked Mar 16, 2019
193 views
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 ...
0 votes
0 votes
0 answers
3
0 votes
0 votes
0 answers
4