Multiple Choice
Consider a language L for which there exists a Turing machine , T, that accepts every word in L and either rejects or loops for every word that is not in L. The language L is
A) NP hard
B) NP complete
C) Recursive
D) Recursively enumerable
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q1: Basic limitation of FSM is that it<br>A)Cannot
Q3: The concept of FSA is much used
Q4: The Family of recursive language is not
Q5: Recursive languages are<br>A)A proper superset of CFL<br>B)Always
Q6: The logic of pumping lemma is a
Q7: Let L be a language defined over
Q8: Which of the following statements is wrong?<br>A)The
Q9: Fred created a new automaton model which
Q10: If a language is denoted by a
Q11: Grammar that produce more than one Parse