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 • 87.94K 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 Answer - Option(C)
Views: 250
Filed under category Theory of Computation and Compiler Design

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Be the first to start discuss.

Q. MIMD stands for

Q. What are the consequences of applying the GOF Singleton pattern?

Q. In full adders the sum circuit is implemented using ________

Q. A tool is piece of software that enables people to deﬁne software testing tasks.

Q. What does command LS do

Q. A schedule S of n transactions is serializable if it is equivalent to some

Q. The Branch instruction in 68000 provides how many types of offsets?

Q. In XP, as soon as the work on a task is complete, it is integrated into the whole system.

Q. What kind of investments does organization have in order to make most of by the software architects in their design?

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

Question analytics