Which of the following conversions is not possible (algorithmically)?

PYQ GATE 1994

Which of the following conversions is not possible (algorithmically)?

  1. A.

    Regular grammar to context-free grammar

  2. B.

    Non-deterministic FSA to deterministic FSA

  3. C.

    Non-deterministic PDA to deterministic PDA

  4. D.

    Non-deterministic Turing machine to deterministic Turing machine

Attempted by 103 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…