0 votes 0 votes how to reduce this type of expression Theory of Computation theory-of-computation regular-expression + – nikkey123 asked Nov 21, 2017 • retagged Nov 22, 2017 by Arjun nikkey123 355 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Rupendra Choudhary commented Nov 22, 2017 reply Follow Share prefer to avoid reduction. it may consume time. better to just check options. this doesn't accept NULL , so eliminate the one that accept NULL , in that way .... 1 votes 1 votes nikkey123 commented Nov 22, 2017 reply Follow Share can u explain which of following option will be true a) set of the string that contain either 'aa' or 'bb' as substring b) set of string that either begin and end with a or b c) Set of string that contain atmost one time two consecutive a’s or two consecutive b’s. d) None of these 0 votes 0 votes Rupendra Choudhary commented Nov 22, 2017 reply Follow Share check one by one C)saying maximum one time 2 consecutive a or b ....there is in last (a+b)* which can give as many consecutive a.b as you want. so false B)string 'a' . begins with a ..so does your language accept this? no so false A) as there is none of above option so we have to take care whether this include all strings of just subset of what's our actual language is...we then find it true. 1 votes 1 votes Please log in or register to add a comment.
0 votes 0 votes Matches with RE: (a+b)*(aa+bb)(a+b)* tech_beardo answered Aug 21, 2020 tech_beardo comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes see at the very last of the expression it contains (a+b)* so convert this expression to finite automata first and you will come to know the reductive and unnecessary steps there and just remove those and express again. arkaprabha1012 answered Aug 22, 2020 arkaprabha1012 comment Share Follow See all 0 reply Please log in or register to add a comment.