M

Mr. Dubey • 52.30K Points
Coach 

Q. If a Turing machine halts for each and every world of a language L and rejects other, then L is said to be

(A) recursive enumerable
(B) recursive
(C) context free language
(D) none of these
Correct : Option (C)

Share

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. which of the following is represented by a series of 1s and 0s?

Q. A concurrency-control policy such as this one leads to performance since it forces transactions to wait for preceding transactions to fi

Q. Is it possible to make quality predictions about a system based solely on evaluation of its architecture?

Q. The polarization of plane waves received from satellite is changed by

Q. In concurrency control policy the lock is obtained on

Q. The operating system maintains a table that keeps track of how many frames have been allocated, how many are there, and how many are ava

Q. Which chart is a tool that depicts project as network diagram that is capable of graphically representing main events of project in both parallel and

Q. Which server can join the indexes when only multiple indexes combined can cover the query:

Q. __________ is a comprehensive plan for achieving its objectives.

Q. The addresses generated by the 68000 is bit.