Home / Engineering / Theory of Computation / Question

M

Mr. Dubey • 51.17K Points
Coach 

Q.) Which of the following statement is false for a turing machine?

(A) There exists an equivalent deterministic turing machine for every nondeterministic turing machine
(B) Turing decidable languages are closed under intersection and complementation
(C) Turing recognizable languages are closed under union and intersection
(D) Turing recognizable languages are closed under union and complementation
Correct answer : Option (D) - Turing recognizable languages are closed under union and complementation

Share

Previous

Next

Discusssion

Login to discuss.

Related MCQs on Theory of Computation

Q. An important characteristic of a CMOS circuit is the

Q. What is the disadvantage of invoking the detection algorithm for every request?

Q. The size of a process is limited to the size of

Q. A is a connector showing the relationship between the representative shapes.

Q. Frequency range supported in Zigbee .............

Q. The return address of the Sub-routine is pointed to by

Q. In TQM , the contributions of quality Guru W. Edward Deming

Q. The keyword “ POSDC” was given by :

Q. Role of staff in “ line and staff “ organization is

Q. =[x+y for x, y in zip(l1, l2)] l3