4 votes 4 votes (aa*)b (abab)+(aaa+b)* Theory of Computation regular-expression + – Anil Dabas asked Jul 14, 2015 Anil Dabas 2.6k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 7 votes 7 votes DFA for L((aa*)b) is DFA for L((abab+(aaa+b)*) is Praveen Saini answered Jul 15, 2015 • selected Jul 15, 2015 by Anil Dabas Praveen Saini comment Share Follow See all 2 Comments See all 2 2 Comments reply Himanshu1 commented Oct 31, 2015 reply Follow Share Here bbabab is accepted according to DFA but not Regular Xpression(2nd case). 0 votes 0 votes LeenSharma commented Oct 10, 2017 reply Follow Share sunil sarode see * on (aaa+b) .The minimum string should be 0 here.not abab. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes L(aa*)b it isnot possible to draw the picture here the transition functions are as follows for above L D(A,a)=(B) D(B,a)= (B) D(B,b)= C (final state) rajesh srivastava answered Jul 15, 2015 rajesh srivastava comment Share Follow See all 0 reply Please log in or register to add a comment.
