Which of the following conversion is not possible (algorithmically)?
(a) Regular grammar to CFG
(b) NDFA to DFA
(c) NDPDA to DPDA
(d) NDTM to DTM
I got this question during an online exam.
The doubt is from Context Free Grammar topic in portion Contextfree Grammar and Syntax Analysis of Compiler