Computer Sciences > GATE 2025 SET-2 > Decidability
Let G1, G2 be Context Free Grammars (CFGs) and R be a regular expression. For a grammar G, let L(G) denote the language generated by G.
Which ONE among the following questions is decidable?
A
Is L(G1)=L(G2)?
B
Is L(G1)∩L(G2)=φ?
C
Is L(G1)=L(R)?
D
Is L(G1)=∅?

Correct : d

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......
Question Options

Contributed by: