Which of the following problems is undecidable?

GATE · 2007 · CS

Which of the following problems is undecidable?

  1. A.

    Membership problem for CFGs

  2. B.

    Ambiguity problem for CFGs.

  3. C.

    Finiteness problem for FSAs.

  4. D.

    Equivalence problem for FSAs.

Attempted by 339 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…