edited by
297 views
0 votes
0 votes

$G1$ and $G2$ are regular grammars and the language generated by any grammar $G$ is represented by $L(G)$. In this case,  $L(G1) \cap L(G2) = \phi$ is a/an:

  1. Decidable problem
  2. Undecidable problem
  3. Cannot ascertain
  4. None
edited by

1 Answer

Best answer
1 votes
1 votes

G1: Regular Grammar and G2:Regular Grammar
Suppose L1= L(G1)   and L2 = L(G2)

Take another language L such that
L= (L1 - L2) U(L2 - L1)    //EXOR of Both
L= (L1∩ L2c) U (L2∩L1c)

L1 and L2 are regular languages hence closed under complement and intersection
L=Regular U Regular = Regular

And Regular is closed under emptiness property, so if L is empty language it means both have disjoint property, so overall problem is Decidable which makes option (A) true.

selected by
Answer:

Related questions

6 votes
6 votes
2 answers
1
Bikram asked Nov 26, 2016
1,184 views
Given a regular grammar $G_1$ and a context free grammar $G_2$, the problem of deciding if $L(G_1)$ is a proper subset of $L(G_2)$ is:DecidableUndecidable but semi-decida...
0 votes
0 votes
1 answer
2
Bikram asked Nov 26, 2016
205 views
Recursive Enumerable Languages are NOT closed under :UnionIntersectionComplementHomomorphism
0 votes
0 votes
1 answer
3
1 votes
1 votes
1 answer
4