81 81 votes The regular expression $0^*(10^*)^*$ denotes the same set as $(1^*0)^*1^*$ $0+(0+10)^*$ $(0+1)^*10(0+1)^*$ None of the above Theory of Computation gatecse-2003 theory-of-computation regular-expression easy + – Kathleen 35.2k views answer comment Share Follow Print See all 25 Comments 25 25 Comments reply Show 22 previous comments Srken commented Dec 12, 2025 reply Follow flag i think it's sandwich property, hope all goclasses students know it. 4 4 replyShare Titan_CSE commented Aug 15 reply Follow flag (D) NONE should be the answer. See, 0*(10*)* can generate null string,0*,1*,... but A) (1*0)*1 cant generate null string and 1* Similarly option B and C fail to generate null string so its obvious in option there is no set that matches the equivalent set of the question. 0 0 replyShare leo_t commented Oct 2 reply Follow flag you forgot A is (1*0)*1* 0 0 replyShare Please log in or register to add a comment.
0 0 votes we can solve by 2 methods by analysis or option elimination Kanta_Bhai answered Apr 28 Kanta_Bhai comment Share Follow 0 reply Please log in or register to add a comment.
