GATE 2011
January 3, 2025UGC NET CS 2017 Jan- paper-3
January 3, 2025GATE 2011
| Question 21 |
Which of the following pairs have DIFFERENT expressive power?
| Deterministic finite automata (DFA) and Non-deterministic finite automata (NFA) | |
| Deterministic push down automata (DPDA) and Non-deterministic push down automata (NFDA) | |
| Deterministic single-tape Turning machine and Non-deterministic single tape Turning machine | |
| Single-tape Turning machine and multi-tape Turning machine |
Question 21 Explanation:
NPDA is more powerful than DPDA.
Hence answer is (B).
Hence answer is (B).
Correct Answer: B
Question 21 Explanation:
NPDA is more powerful than DPDA.
Hence answer is (B).
Hence answer is (B).