0 votes
95 views
What will be the regular expression for the language consisting of all binary strings which have at most one pair of consecutive zeroes?
asked
reshown | 95 views
0
is(1+01)*(0+00+epsilon)(1+01)* correct?

## 1 Answer

+5 votes
Best answer

Break it down into : "Exactly One Pair of Consecutive Zeroes" $+$ "NO pair of Consecutive zeroes"

Now,

"Exactly One Pair of Consecutive Zeroes" =  $(1 + 01)^* \,00 (1+10)^*$

"NO pair of Consecutive zeroes" =  $(1 + 01)^*(0 + \in)$

So, Now combine these Two and We will have :

The regular expression for the language consisting of all binary strings which have at most one pair of consecutive zeroes :

$(1 + 01)^* \,00 (1+10)^*$  $+$   $(1 + 01)^*(0 + \in)$

(You could take  $(1 + 01)^*$ common and simplify further But for understanding purpose, let it be the way it is)

answered by Boss (18.3k points)
selected
0
Got it bro :)

+1 vote
1 answer
1
0 votes
0 answers
2
+2 votes
2 answers
3