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

Published by Mr. Dubey ⭐ 111.42K Points at 18-Sep-2023 04:33 pm in Theory of Computation

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

306

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

97%

Success Rate