Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Undecidability
Let G1 and G2 be arbitrary context free languages and R an arbitrary regular language.
Consider the following problems:
(A) Is L(G1) = L(G2)?
(B) Is L(G2) ≤ L(G1)?
(C) Is L(G1) = R?
Which of the problems are undecidable ?
Choose the correct answer from the options given below:
1
(A) only
2
(B) only
3
(A) and (B) only
4
(A), (B) and (C)