Which of the following problems is undecidable?
GATE · 2007 · CS
Which of the following problems is undecidable?
- A.
Membership problem for CFGs
- B.
Ambiguity problem for CFGs.
- C.
Finiteness problem for FSAs.
- D.
Equivalence problem for FSAs.
Attempted by 339 students.
Sign up free to check your answer
Sign up freeLoading lesson…