Let 𝐺1 and 𝐺2 be arbitrary context free languages and 𝑅 an arbitrary…
PYQ UGC NET 2020
Let 𝐺1 and 𝐺2 be arbitrary context free languages and 𝑅 an arbitrary regular language. Consider the following problems:
(A) Is 𝐿(𝐺1)=𝐿(𝐺2)?
(B) Is 𝐿(𝐺2)≤𝐿(𝐺1)?
(C) Is 𝐿(𝐺1)=𝑅?
Which of the problems are undecidable?
Choose the correct answer from the options given below:
- A.
(A) Only
- B.
(B) Only
- C.
(A) and (B) Only
- D.
(A), (B) and (C)
Attempted by 78 students.
Sign up free to check your answer
Sign up freeLoading lesson…

