Consider a string s over (0+1)*. The number of 0’s in s is denoted by no(s) and the number of 1’s in s is denoted by n1(s). The language that is not regular is

Mr. Dubey • 52.26K Points
Coach

Q. Consider a string s over (0+1)*. The number of 0’s in s is denoted by no(s) and the number of 1’s in s is denoted by n1(s). The language that is not regular is

(A) L = {s ε (0+1)* I for every prefix s’ of s, I no(s’)-n1(s’) I ≤ 2}

(B) L = {s ε (0+1)* I no(s) mod 7 = n1(s) mod 5 = 0}

(D) L = {s ε (0+1)* I no(s)-n1(s) I ≤ 4

Correct : Option (D)

Discusssion

Q. The addresses generated by the 68000 is bit.

Q. Which of the following is based on Multi Valued Dependency?

Q. The broadband jammer jams the entire

Q. In a real time system the computer results ____________

Q. If the binary equivalent of the decimal number 48 is 110000, then the binary equivalent of the decimal number 51 is given by

Q. The leaf nodes of a model tree are

Q. ______can be adopted when it's necessary to categorize a large amount of data with a few complete examples or when there's the need to impose some con

Q. The AT bus is also known as the ____ bus.

Q. During error reporting, ICMP always reports error messages to ________

Q. Consider a string s over (0+1)*. The number of 0’s in s is denoted by no(s) and the number of 1’s in s is denoted by n1(s). The language that is not regular is

Discusssion

Related MCQs