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
Q21: A minimum state deterministic finite automation accepting
Q22: Any Language generated by an unrestricted grammar
Q23: The Family of recursive language is not
Q24: PCP is:
A)Decidable
B)Undecidable
C)Sometimes Decidable
D)None of the
Q25: If PCP is decidable then MPCP is
A)Decidable
B)Undecidable
C)Can't
Q27: Consider the following statements
I. Recursive languages are
Q28: Recursively enumerable languages are not closed under
A)Union
B)homomorphism
C)complementation
D)concatenation
Q29: Which of the following problem is undecidable?
A)Membership
Q30: Recursive languages are
A)A proper superset of CFL
B)Always
Q31: Consider the following problem x. Given a
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents