2 votes 2 votes What is the regular expression for all strings over {0, 1} not containing the substring 101? Theory of Computation theory-of-computation regular-expression + – nishant279 asked Aug 15, 2017 nishant279 860 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Tesla! commented Aug 15, 2017 reply Follow Share First use 0* inside bracket to generate 00 Then use 11*00 to generate 1100 The use 1* to generate 11 Then use 0* to generate 00 0 votes 0 votes joshi_nitish commented Aug 15, 2017 reply Follow Share now see edited comment.. 0 votes 0 votes Tesla! commented Aug 15, 2017 reply Follow Share See now I also edited comment 1 votes 1 votes Please log in or register to add a comment.
0 votes 0 votes Regular Expression = 0*11*( ͼ +0) + (0+11*00)* + (1+000*1)* + (00*11*0)* yogi_p answered Aug 17, 2017 edited Aug 21, 2017 by yogi_p yogi_p comment Share Follow See all 13 Comments See all 13 13 Comments reply Show 10 previous comments yogi_p commented Aug 22, 2017 reply Follow Share @joshi_nitish Thanks man !! (It was great help , I was struck on such questions from quite few days. I now understood how to solve it.) Thanks a ton :) 0 votes 0 votes pallaviamu commented Apr 21, 2018 reply Follow Share Great solution... can you solve this with Arden's theorem as well, I am unable to solve Also I have a doubt what if we try to eliminate middle state i.e. 2nd one instead of 3rd then I am getting different regular expression- (0+1*00)*(11*0+epslon) 0 votes 0 votes Shubhgupta commented Apr 21, 2018 reply Follow Share @pallaviamu, hope this will help 0 votes 0 votes Please log in or register to add a comment.