Which of the following conversions is not possible (algorithmically)?
Regular grammar to context free grammar
Non-deterministic FSA to deterministic FSA
Non-deterministic PDA to deterministic PDA
Non-deterministic Turing machine to deterministic Turing machine
This will be C. Because if that would have been possible then NPDA and DPDA must had same powers, which is not the case. You can take example of NFA and DFA. Both are convertible to each other and hence share the same power.
Refund time depends on the payment mode --...