0 votes 0 votes The regular expression denoting the set of all strings not containing two consecutive 1's is given by A) (0+10)*(EPSILON+0) B) (1+01)* C) (0+10)*(EPSILON+1) D) (EPSILON+0)(001)*(EPSILON+0) Theory of Computation regular-expression + – Sindhu Bandaru asked Aug 10, 2018 Sindhu Bandaru 3.9k views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Bhagyashree Mukherje commented Aug 10, 2018 reply Follow Share Is the answer c? 0 votes 0 votes Sindhu Bandaru commented Aug 10, 2018 reply Follow Share I'm also getting option C but it is not the answer given 0 votes 0 votes Bhagyashree Mukherje commented Aug 10, 2018 reply Follow Share I guess option c is right because Option A : We cannot generate string 1,01,or 101 etc Option B : We cannot generate string 0 , 10 and so on Option D : We cannot generate string 1, 10 etc 0 votes 0 votes arvin commented Aug 10, 2018 reply Follow Share take the complement of the dfa that you will make for dfa accepting 11 and write the reg. expression. u will easily get option C 0 votes 0 votes Yashaswi commented Aug 13, 2018 reply Follow Share The answer is c. (a+b)* has all the combinations of a and b. so in (0+10)*(EPSILON + 1), you will have all combinations of 00,01,10 but not 11. Also you will preserve the empty string and the single length strings 0 and 1. 0 votes 0 votes Please log in or register to add a comment.