aliensbrain
  • Home
  • Study
  • Quizzes
  • 🎤AI Practicefree
  • Notebooks
  • Community
  • Sign in
  • Test 1 - Theory of Computation | Computer Science(CS)
  • For S $\in$ (0 + 1) * let d (s) denote the decimal value ...
Multiple choice

For S $\in$ (0 + 1) * let d (s) denote the decimal value of s (e.g. d (101) = 5). Let L = {s $\in$ (0 + 1)* d (s)mod 5 = 2 and d (s) mod 7 $\ne$ 4} Which one of the following statements is true?

  1. L is recursively enumerable, but not recursive

  2. L is recursive, but not context-free

  3. L is context-free, but not regular

  4. L is regular

Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

Keep practicing — related questions

  • How many 4 digit numbers can be formed out of the digits 0, 1, 2, 3 and 4 if no digit is repeated?
  • Directions: Choose the correct option for the given question. Which of the following statements is/are corr...
  • Directions: Choose the correct option for the given question:Consider the following statements in respect o...
  • Consider the following reasons of continuous decline in average landholding size in India 1. Law of inherit...
  • How many characters per sec (7 bit + 1 parity) can be transmitted over a 2,400 bps, if the transfer is asyn...
  • How many 4 digit numbers greater than 5000 can be formed out of the digits 3, 4, 5, 6 and 7 ( no digit bein...
  • If you save 1 paise today, 2 paise the next day , 4 paise the succeeding day and so on, then your total sav...
  • In which of the following trees balance factor of each node be either of 1, -1or 0?
Play the full quiz 🎤 Practise this topic out loud
Advertisement
© Aliensbrain | all rights reserved
  • About
  • Contact
  • Terms and Condition
  • Privacy Policy