Multiple Choice
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
Correct Answer:
Verified
Q12: Which of the following statement is true?<br>A)All
Q13: Let L be any infinite regular language,
Q14: Recursively enumerable languages are not closed under<br>A)Complementation<br>B)Union<br>C)Intersection<br>D)None
Q15: Which of the following assertions about Turing
Q16: The regular expression have all strings in
Q18: Suppose that a problem A is known
Q19: If an effectively solvable problem has answered
Q20: Languages are proved to be regular or
Q21: The languages -------------- are the examples of
Q22: _ states are called the halt states.<br>A)ACCEPT