4 votes 4 votes $$\begin{align*} \large\color{green}{L_1 = L\left ( a^{*}bb \right ) \cup L\left ( ab^{*}ba \right ) } \\ \end{align*}$$ Minimal DFA for $L_1$ Theory of Computation theory-of-computation minimal-state-automata finite-automata + – dd asked Dec 23, 2016 dd 940 views answer comment Share Follow See all 13 Comments See all 13 13 Comments reply Kapil commented Dec 23, 2016 reply Follow Share Again a big question !! 0 votes 0 votes dd commented Dec 23, 2016 reply Follow Share I just want to know other possibilities except product automata. 0 votes 0 votes Kapil commented Dec 23, 2016 reply Follow Share Then it takes a long time with hit and trial as compared to product automata . 0 votes 0 votes Kapil commented Dec 23, 2016 i edited by Kapil Dec 23, 2016 reply Follow Share ............. 2 votes 2 votes vijaycs commented Dec 23, 2016 reply Follow Share @Kapil, Please check for the following strings- 1. bb(a+b)+. 2. abaa , abab , ... 3. abbab, abbaa ... I think, all above strings should not be accepted but they are being accepted by your final automata. ?? 0 votes 0 votes Kapil commented Dec 23, 2016 reply Follow Share Yeah, hence the whole thing goes wrong :) 0 votes 0 votes vijaycs commented Dec 23, 2016 reply Follow Share Thanks, downvoters .. :) Obviously, it's not you @Kapil..because you too have got 1. : ) 0 votes 0 votes dd commented Dec 23, 2016 reply Follow Share I have not done anything !! ..just checking comments now ! 1 votes 1 votes vijaycs commented Dec 23, 2016 reply Follow Share @Debashish, I know you bro... you are one of the honest and intelligent fellow here on Gateoverflow..: ) Actually, I don't know who does so .. downvoting comments/ans is okay but it would be better if he/she tells the fault . 0 votes 0 votes ManojK commented Dec 23, 2016 reply Follow Share One possibility. Now you can transform above $\epsilon$ NFA to DFA. 3 votes 3 votes Kapil commented Dec 23, 2016 reply Follow Share @vijaycs I didn't downvote anyone :) But, thanks for rectifying me !! I was totally wrong :) 1 votes 1 votes Kapil commented Dec 23, 2016 reply Follow Share @Manojk You are always trûe :) 1 votes 1 votes vijaycs commented Dec 23, 2016 reply Follow Share @Kapil, please read my 2nd comment on this thread ..: ) 1 votes 1 votes Please log in or register to add a comment.
0 votes 0 votes tell me if i made some mistake Rupendra Choudhary answered Jun 1, 2017 Rupendra Choudhary comment Share Follow See 1 comment See all 1 1 comment reply joshi_nitish commented Aug 6, 2017 reply Follow Share @Rupendra Choudhary, your dfa is accepting "aaabba", which is not in language. 0 votes 0 votes Please log in or register to add a comment.
