Data-Communication
March 6, 2024Theory-of-Computation
March 6, 2024Grammar
| Question 1 |
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 1 Explanation:
NPDA to DPDA conversion is not possible. They have different powers.
Correct Answer: C
Question 1 Explanation:
NPDA to DPDA conversion is not possible. They have different powers.
Subscribe
Login
0 Comments