M

Mr. Dubey • 100.69K Points
Coach

Q. Which one of the following languages over the alphabet {0,1} is described by the regular expression: (0+1)*0(0+1)*0(0+1)*?

  • (A) The set of all strings containing the substring 00.
  • (B) The set of all strings containing at most two 0’s.
  • (C) The set of all strings containing at least two 0’s.
  • (D) The set of all strings that begin and end with either 0 or 1.
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. PLD contains a large number of

Q. Attribute-based identification is

Q. Which of the following display content of file1 ?

Q. An architecture where clients first communicate the server for data then format and display it to the users, is known as

Q. Unit testing is carried out by:

Q. signal system call…………

Q. Under mechanism of scientific management, scientific task setting includes:

Q. In many classification problems, the target dataset is made up of categorical labels which cannot immediately be processed by any algorithm. An encodi

Q. Add 648 and 487 in BCD code.

Q. Linux uses a time-sharing algorithm

Question analytics