You are not logged in.

#1 2015-06-27 03:57:31

hasnain
Administrator
From: Chichawatni
Registered: 2014-10-13
Posts: 8,355
Website

Regular Expression:

Mathematics Quizzes Theory Of Computation

Question:
The language described by the regular expression (0+1)*0(0+1)*0(0+1)* over the alphabet {0 1} is the set of:

Option A):
All strings containing the substring 00
Option B):
All strings containing at least two 0s
Option C):
All strings that begin and end with either 0s or 1s
Option D):
All strings containing at least two 1s

Correct Answer is Option B):
All strings containing at least two 0s


Failure is the first step towards seccess.

2015-06-27 03:57:31

Advertisement
Ads By Google

Re: Regular Expression:



Board footer