3,128 views

4 Answers

2 votes
2 votes

Since  

(0+1)(0+1)*=(0+1)+  => ((0+1)+)*=(0+1)*

Therefore resulting grammar will be like below

(0+1)*00(0+1)*=====> Contains atleast two consecutive zeros

1 votes
1 votes
it same as writing (0+1)*00(0+1)*

L contains strings with atleast 2 zeroes
1 votes
1 votes
This RE represents a language containing 00 as a substring
0 votes
0 votes

L=( (0 + 1) (0 + 1)*)* 00 (0 + 1)*

L has all substring with atleast two zeros

Related questions

0 votes
0 votes
1 answer
2
M_Umair_Khan42900 asked Dec 29, 2022
788 views
Show that the following pairs of regular expressions define the same language over the alphabet I = [a, b].s(a) p(pp)*( A + p)q + q and p*q(b) A +0(0+1)* + (0+1)* 00(0+1)...
3 votes
3 votes
2 answers
4
im.raj asked Jun 16, 2016
20,845 views
A. [(00(0+1)* 11] + [11( 0 + 1)* 00]B. [(00+11) (0+1)+] + [( 0 + 1)+ (00+11)].C. [(00+11) (0+1)*] + [( 0 + 1)* (00+11)]D. (00+11) (0+1)* (00+11).