Which of the following conversion is not possible (algorithmically)?

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Theory of Computation

Q. Which of the following conversion is not possible (algorithmically)?

(A) regular grammar to context-free grammar
(B) non-deterministic finite state automata to deterministic finite state automata
(C) non-deterministic pushdown automata to deterministic pushdown automata
(D) none deterministic turing machine to deterministic turing machine

💬 Discuss

✅ Correct Answer: (B) non-deterministic finite state automata to deterministic finite state automata

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

290

Total Visits

📽️

2 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

95%

Success Rate