Which of the following problems is undecidable ?

PYQ UGC NET 2017

Which of the following problems is undecidable ?

  1. A.

    To determine if two finite automata are equivalent

  2. B.

    Membership problem for context free grammar

  3. C.

    Finiteness problem for finite automata

  4. D.

    Ambiguity problem for context free grammar

Attempted by 204 students.

Sign up free to check your answer

Sign up free

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…