+15 votes
1.4k views

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)^*$?

1. The set of all strings containing the substring $\text{00}$
2. The set of all strings containing at most two $\text{0}$'s
3. The set of all strings containing at least two $\text{0}$'s
4. The set of all strings that begin and end with either $\text{0}$ or $\text{1}$
asked
edited | 1.4k views

3 Answers

+25 votes
Best answer

(C) is the answer.

Counter example for other choices:

1. $1010$ is accepted which doesn't contain $00$
2. $000$ is accepted
3. is the answer.
4. $01$ is not accepted
answered by Veteran (384k points)
edited by
+9 votes

a) all string contain substring 00

regular expression = Anything 00 Anything  = (0+1)*00(0+1)*

b)all string contain atmost two 0's

regular expression = only 2 zeros  + only 1 zero  + No zero = Anthing 0 Anything 0 Anything + Anything 0 Anything  + Anything = 1*01*01* + 1*01* + 1*

here anything means that is made of only 1's bcoz we have to restrict 0 (only two or less) so anything cannot include 0.

c) all string contain atleast two 0's

regular expression = Anything 0 Anything 0 Anything = (0+1)*0(0+1)*0(0+1)*

d) all strings that begin and end with either 0 or 1

regular expression = either 0 or 1  Anything either 0 or 1 = (0+1)(0+1)*(0+1)

answered by Veteran (55.8k points)
+1
All are same for strings containing atleast 2 0's.
0 votes
The regular expression has two 0′s surrounded by (0+1)* which means accepted strings must have at least 2 0′s.

So, C is the answer
answered by Loyal (9.3k points)
Answer:

+22 votes
6 answers
1
+28 votes
5 answers
2
+24 votes
5 answers
3
+16 votes
4 answers
4
+4 votes
1 answer
5
+23 votes
2 answers
6
+20 votes
2 answers
7