Data-Communication
March 6, 2024GATE 1994
March 6, 2024Theory-of-Computation
|
Question 14
|
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
|
Question 14 Explanation:
NPDA to DPDA conversion is not possible. They have different powers.
Correct Answer: C
Question 14 Explanation:
NPDA to DPDA conversion is not possible. They have different powers.