GATE CSE 2011 | Question: 8

Question

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 push down automata (NPDA)
• C. Deterministic single tape Turing machine and Non-deterministic single tape Turing machine
• D. Single tape Turing machine and multi-tape Turing machine

Comments

Just to add.

Expressive power of the following version of Deterministic Turing machine is same

• Multistack TM
• Multitape TM
• 2 stack TM (single stack TM will be less powerful than standard TM)
• Counter TM (number of counters should be greater than 1; 1 counter TM is less powerful than standard TM)
• Nondeterministic TM

---

we cannot create a dpda for every npda

Answer 1

Expressing power of any machine can be defined as the maximum number of languages it can accept..if machine $M_1$ can accept more languages then $M_2$ then we can say that expressing power of $M_1$ is greater then $M_2$.

• A. Languages accepted by NFA,will also be accepted by DFA because we can make DFA corresponding to NFA. So their expressing power is same.
• B. In this case languages accepted by NPDA is more then DPDA, so expressing power of NPDA is more then DPDA
• C. Both deterministic and non deterministic turing can accept same language.so there expressing power is same.
• D. In turing machine if we increase the number of tape then also language accepted by that machine is same as single tape turing machine.so there expressing power is same.

Answer is B.

Answer 2

(B) Deterministic push down automata (DPDA) and Non-deterministic push down automata (NPDA)

In rest of the options both machine are equivalent in power.

Answer 3

In given option all are same expressive power but NPDA  and DPDA have different expressive power

So option B is true.