in Theory of Computation
3,108 views
4 votes
4 votes
in Theory of Computation
3.1k 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 vote
1 vote
it same as writing (0+1)*00(0+1)*

L contains strings with atleast 2 zeroes

2 Comments

Language having at least 2 consecutive zeroes.
0
0
No atleast 2 zeroes can be 010 also ryt ?

But the answer should be string containing 2 zeroes
0
0
1 vote
1 vote
This RE represents a language containing 00 as a substring
by
0 votes
0 votes

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

L has all substring with atleast two zeros

4 Comments

can we say sir cantaining substring 00
2
2
yes, all strings containing 00 as substring.
3
3
yes all substring with atleast two consecutive  zeros .rt?
0
0

Related questions