If Turing machine accepts all the words of the languages L and rejects or loops for other words, which are not in L, then L is said to be

Home / Engineering / Theory of Computation / Question

M

Mr. Dubey • 51.17K Points
Coach

Q.) If Turing machine accepts all the words of the languages L and rejects or loops for other words, which are not in L, then L is said to be

(A) recursive enumerable

(B) recursive

(C) context free language (cfl)

(D) none of them

Correct answer : Option (A) - recursive enumerable

Share

Discusssion

Login to discuss.

Related MCQs on Theory of Computation

Q. Which of the following statement is true about outliers in Linear regression?

Q. The spiral model has two dimensions namely _____________ and ____________

Q. Which of the following will happen when data is entered into a memory location?

Q. Which of the following is true about top- down design process?

Q. The number of distinct simple graphs with up to three nodes is _________.

Q. Scheduling is done so as to

Q. The binary address issued to data or instructions are called as

Q. If the wait for graph contains a cycle

Q. What is the output of the following? def to_upper(k): return k.upper() x = ['ab', 'cd'] print(list(map(to_upper, x)))

Q. Is It Possible To Run Program Without Main() Function?