Which of the following problems are undecidable?

PYQ GATE 1989

Which of the following problems are undecidable?

  1. A.

    Membership problem in context-free languages.

  2. B.

    Whether a given context-free language is regular.

  3. C.

    Whether a finite state automation halts on all inputs.

  4. D.

    Membership problem for type 00 languages.

Attempted by 35 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…