___________ states are called the halt states.

Home / Engineering / Theory of Computation / Question

M

Mr. Dubey • 51.47K Points
Coach

Q.) ___________ states are called the halt states.

(A) ACCEPT and REJECT

(B) ACCEPT and READ

(C) ACCEPT AND START

(D) ACCEPT AND WRITE

Correct answer : Option (A) - ACCEPT and REJECT

Share

Discusssion

Login to discuss.

Related MCQs on Theory of Computation

Q. An consists of a search-key value and pointers to one or more records with that value as their search-key value.

Q. A hash function must meet criteria.

Q. Which one of the following multimedia formats can not be supported by RTP?

Q. Once the BUS is granted to a device

Q. A perceptron adds up all the weighted inputs it receives, and if it exceeds a certain value, it outputs a 1, otherwise it just outputs a 0.

Q. The purpose of JIT compiler is to convert____________.

Q. Languages are proved to be regular or non regular using pumping lemma.

Q. Recursively enumerable languages are not closed under

Q. Stored procedures are safe from SQL injection attacks

Q. Under what case of Master’s theorem will the recurrence relation of binary search fall?