Home / Engineering / Theory of Computation / Question

M

Mr. Dubey • 51.17K 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. State true or false. i) Select operator is not a unary operator. ii) Project operator chooses subset of attributes or columns of a relation.

Q. In on-line scheduling, scheduler make the schedule ……………………... that will be released in future.

Q. Which of the following file organization is most efficient for a file with a high degree of file activity?

Q. Which one of the following event is not possible in wireless LAN?

Q. In the __________ normal form, a composite attribute is converted to individual attributes.

Q. Objects of the string class

Q. The swaps processes in and out of the memory.

Q. In which type of streaming multimedia file is delivered to the client, but not shared?

Q. Frame Relay networks offer an option called _______

Q. Perform encryption on the following PT using RSA and find the CT. p = 5; q = 11; M= 9.