If s is a string over (0 + 1)* then let n0 (s) denote the number of 0’s in s and n1 (s)the number of l’s in s. Which one of the following languages is not regular?

Mr. Dubey • 52.30K Points
Coach

Q. If s is a string over (0 + 1)* then let n0 (s) denote the number of 0’s in s and n1 (s)the number of l’s in s. Which one of the following languages is not regular?

(A) L = {s € (0 + 1)*n0 (s) is a 3-digit prime

(B) L = {s € (0 + 1)* | for every prefix s’ of s, l 0 (s’) — n1 (s’) | <= 2 }

(D) L = {s € (0 + 1) | n0 (s) mod 7 = n1 (s) mod 5 = 0 }

Correct : Option (C)

Discusssion

Be the first to start discuss.

Q. is used by Amazon Web Services to store copies of a virtual machine.

Q. Which of the following is not an Eigen value of the adjacency matrix of the complete bipartite graph?

Q. Which among the following is more powerful?

Q. What is the octal equivalent of the binary number: 10111101

Q. An ________ is a set of entities of the same type that share the same properties, or attributes.

Q. What information is required to process a change to a baseline?

Q. The operation, denoted by −, allows us to ﬁnd tuples that are in one relation but are not in another.

Q. The design and implementation of synchronous counters start from

Q. A linear collection of data elements where the linear node is given by means of pointer is called?

Q. If s is a string over (0 + 1)* then let n0 (s) denote the number of 0’s in s and n1 (s)the number of l’s in s. Which one of the following languages is not regular?

Discusssion

Related MCQs