Question 2052 – Nielit Scientific Assistance CS 15-10-2017
November 9, 2023
Question 2056 – Nielit Scientific Assistance CS 15-10-2017
November 9, 2023
Question 2052 – Nielit Scientific Assistance CS 15-10-2017
November 9, 2023
Question 2056 – Nielit Scientific Assistance CS 15-10-2017
November 9, 2023

Question 2053 – Nielit Scientific Assistance CS 15-10-2017

A language L for which there exists a TM,, ‘T’, that accepts every word in L and either rejects or loops for every word that is not in L, is said to be

Correct Answer: B

Question 7 Explanation: 
A language L for which there exists a TM,, ‘T’, that accepts every word in L and either rejects or loops for every word that is not in L, is said to be recursively enumerable
A
recursive
B
recursively enumerable
C
NP-Hard
D
None of the above
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x
error: Alert: Content selection is disabled!!