For s ? (0+1) * let d(s) denote the decimal value of s(e.g.d(101) ) = 5 Let L = {s ? (0+1) * d(s) mod 5=2 and d(s) mod 7 != 4} Which one of the following statements is true?
A) L is recursively enumerable, but not recursive
B) L is recursive, but not context-free
C) L is context-free, but not regular
D) L is regular
Correct Answer:
Verified
Q9: Which of the following assertions about Turing
Q10: A PC not connected to a network
Q11: Recursively enumerable languages are not closed under:
A)Union
B)Intersection
C)Complementation
D)Concatenation
Q12: Let L1 be a recursive language, and
Q13: Let S be an NP-complete problem, Q
Q15: A FSM can be considered, having finite
Q16: Which of the following statement is true?
A)All
Q17: Recursively enumerable languages are not closed under
A)Complementation
B)Union
C)Intersection
D)None
Q18: The following CFG is in
S ? Abb
B
Q19: The languages -------------- are the examples of
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