Open In App
Related Articles

GATE | GATE-CS-2007 | Question 6

Improve
Improve
Improve
Like Article
Like
Save Article
Save
Report issue
Report
Which of the following problems is undecidable? [2007] (A) Membership problem for CFGs (B) Ambiguity problem for CFGs. (C) Finiteness problem for FSAs. (D) Equivalence problem for FSAs.

Answer: (B)

Explanation:
A set is closed under an operation means when we operate an element of that set with that operator we get an element from that set.
Here, CFG generates a CFL and set of all CFLs is the set. But ambiguity is not an operation and hence we can never say that CFG is closed under such operation.
Only ambiguity problem for CFGs are undecidable.
 
Thus, option (B) is correct.
 
Please comment below if you find anything wrong in the above post.

Quiz of this Question

Last Updated : 28 Jun, 2021
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads