Which of the following conversions is not possible (algorithmically)?
PYQ GATE 1994
Which of the following conversions is not possible (algorithmically)?
- A.
Regular grammar to context-free grammar
- B.
Non-deterministic FSA to deterministic FSA
- C.
Non-deterministic PDA to deterministic PDA
- D.
Non-deterministic Turing machine to deterministic Turing machine
Attempted by 103 students.
Sign up free to check your answer
Sign up freeLoading lesson…

