edited by
2,072 views
2 votes
2 votes
find the length of string of minimum length in {0,1}* not in the language corresponding to the given RE

(0*+1*)*

a) 0

b) 1

c) more than 1

d) can't be determined
edited by

2 Answers

1 votes
1 votes
as (0* + 1*)* =(0+1)*

there will no such string possible.

also

(0 + 1* )* = (0* + 1)*=(0*.1*)*=0*(1.0*)*=1*(0.1*)*
0 votes
0 votes
(0*+1*)*=(0+1)*

possible string of length of 0 and 1 over of (0,1) ={epsilion,0,1}

so all the three string are formed by this RE.

so option d is correct

Related questions

2 votes
2 votes
2 answers
1
charul asked Oct 7, 2017
836 views
find regular expression over {a,b} corresponding to "set of strings containing at most 2a's."a) b*+ b*ab* + b*ab*ab*b) b*(a+ε)b*(a+ε)c) none