Home / Engineering / Theory of Computation / Question

M

Mr. Dubey • 51.43K Points
Coach 

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
Correct answer : Option (B) - Deterministic push down automata (DPDA) and Non-deterministic pushdown automata

Share

Previous

Next

Discusssion

Login to discuss.

Related MCQs on Theory of Computation

Q. HCI design standards include recommendations based on

Q. Which of the following commands is used to summarize the disk usage?

Q. This characteristic often draws the line between what is feasible and what is impossible.

Q. An SMTP session may not include

Q. MICR stands for

Q. For p = 11 and q = 19 and choose e=17. Apply RSA algorithm where message=5 and find the cipher text.

Q. Can you store multiple data types in System.Array?

Q. LRU page – replacement algorithm associates with each page the

Q. __is used to create the organisation's overall security program.

Q. This is a time-sensitive service: