Q. Which of the following pairs have DIFFERENT expressive power?

(A) Deterministic finite automata (DFA) and Non-Deterministic finite automata(NFA)
(B) Deterministic push down automata (DPDA) and Non-deterministic pushdown automata
(C) Deterministic single-tape Turing machine and Non-deterministic single-tape Turing Machine
(D) Single-tape Turing machine and multi-tape Turing machine

💬 Discuss

✅ Correct Answer: (B) Deterministic push down automata (DPDA) and Non-deterministic pushdown automata

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

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

969

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

87%

Success Rate