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
Q5: Let L<sub>1</sub> be a recursive language. Let
Q6: A minimum state deterministic finite automation accepting
Q7: If s is a string over (0
Q8: Consider the following two problems on undirected
Q9: Consider the set of strings on
Q11: Consider the language L<sub>1</sub>,L<sub>2</sub>,L<sub>3</sub> as given below.<br>L<sub>1</sub>={0^{p}1^{q}
Q12: Consider the following statements about the context
Q13: The minimum state automaton equivalent to the
Q14: Let L<sub>1</sub> be a recursive language, and
Q15: Definition of a language L with alphabet