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

GATE · 1994 · CS · Question 1 subparts

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 29 students.