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 Theory of Computation theory-of-computation made-easy-booklet regular-expression + – charul asked Oct 7, 2017 edited Mar 6, 2019 by ajaysoni1924 charul 2.1k views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments priyanka HS commented Oct 9, 2017 reply Follow Share a)0, since (0*+1*)* contains all the strings over {0, 1}* . 0 votes 0 votes Rishabh Gupta 2 commented Oct 10, 2017 reply Follow Share @priyanka HS String of length 0 means epsilon, which is in the given language. So it can't be the answer. 0 votes 0 votes Ram Swaroop commented Dec 19, 2018 reply Follow Share Option d This language contain {€,1,0,11,10,01,00,111,.........................} 0 votes 0 votes Please log in or register to add a comment.
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*)* abhijeet pandey answered Oct 7, 2017 abhijeet pandey comment Share Follow See all 0 reply Please log in or register to add a comment.
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 amit kumar 16 answered Oct 7, 2017 amit kumar 16 comment Share Follow See all 0 reply Please log in or register to add a comment.