0 votes 0 votes $(\ 0\ +\ (\ 1\ (\ 0\ 1^*\ 0\ )^*\ 1\ ))^*$ How can the above regular expression produce this string: $1100100011011001011$ Theory of Computation theory-of-computation regular-expression + – Tuhin Dutta asked Dec 14, 2017 Tuhin Dutta 312 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply joshi_nitish commented Dec 14, 2017 reply Follow Share the above RE is equivalent to, (0 + 1(00 + 010 + 0110 +....)*1 )* writing 1100100011011001011 in partition as 11 00 10001101 1001 0 11 now, carefully see each partition can be derived from above RE 4 votes 4 votes Tuhin Dutta commented Dec 14, 2017 reply Follow Share Understood, Thanks. 0 votes 0 votes Tuhin Dutta commented Dec 14, 2017 reply Follow Share In the 2nd partition from left, i.e 00, it should be 0 0 instead of 00 .right? 0 votes 0 votes joshi_nitish commented Dec 14, 2017 reply Follow Share yes, it is trivial so i wrote it as 00 only. 1 votes 1 votes Please log in or register to add a comment.