The Gateway to Computer Science Excellence
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 for any fixed $G_2,$ as long as $L(G_2)$ is not empty.
in Theory of Computation by Boss (11.4k points) | 10 views

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,647 questions
56,490 answers
100,663 users