1 votes 1 votes Theory of Computation theory-of-computation regular-expression regular-language + – Aakanchha asked Dec 31, 2017 Aakanchha 910 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments hacker16 commented Jan 1, 2018 reply Follow Share @Mk Utkarsh (01* + 10*)* to generate 0010, (01*)(01*)(10*)(01*) = 0010 0 votes 0 votes Mk Utkarsh commented Jan 1, 2018 reply Follow Share yeah i got that wrong thanks :) 1 votes 1 votes Aakanchha commented Jan 1, 2018 reply Follow Share @hacker16 according to me also (b) should be correct but the answer was given as (c), as per the explanation given there, only (01* + 10*)* is (0+1)* and hence other two are subset of it. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes All the given regular expression are of form (0+1)*. So L(r1)=L(r2)=L(r3) NOTE:(0+1)*=(0*+1)*=(0+1*)*=(0*+1*)*=(0*1*)*=(1*0*)*=0*(10*)*=1*(01*)* Parth Shah answered Feb 23, 2018 • edited Mar 31, 2019 by Parth Shah Parth Shah comment Share Follow See all 2 Comments See all 2 2 Comments reply Kuljeet Shan commented Mar 30, 2019 reply Follow Share @Parth Shah I think in above note these two are not equal (0+1)* = (1*0*), because e.g 1010 is going to generate by (0+1)* but not by (1*0*). (0*1*)*=(1*0*) these two are also not equal because of same reason. (0+1*)*=(0*+1*) these two are also not equal because of same reason. Similarly, with others so please update your answer. 0 votes 0 votes Parth Shah commented Mar 31, 2019 reply Follow Share Edited the answer. Check now. 0 votes 0 votes Please log in or register to add a comment.