M

Mr. Dubey • 100.69K 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 }
  • (C) L={s € (0+1)* | n0(s) - n1(s) | <= 4}
  • (D) L = {s € (0 + 1) | n0 (s) mod 7 = n1 (s) mod 5 = 0 }
Share

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

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. How many of the following statements are correct?

Q. In which testing level the focus is on customer usage?

Q. The address system supported by ARM systems is/are ___________

Q. IP assigned for a client by DHCP server is

Q. in , all the columns in the same row are either read or written.

Q. In "bash", "if" constructs are ended with

Q. The language which has recently become the defacto standard for interfacing application programs with relational database system is

Q. If one doesn't want anyone else to read or write to a file named datfile, except through a program in a file filex , then he may use

Q. VxWorks is centered around ___________

Q. has many of the characteristics of what is now being called cloud computing

Question analytics