GATE 1995
January 24, 2024Question 9231 – GATE 2007
January 24, 2024Question 9230 – GATE 2007
Which of the following problems is undecidable?
Correct Answer: B
Question 6 Explanation:
Whether a given CFG is ambiguous, this problem is undecidable. The reason is there is no algorithm exist for this. Remaining all are decidable.
Membership problem for CFGs.
Ambiguity problem for CFGs.
Finiteness problem for FSAs.
Equivalence problem for FSAs.