1 votes 1 votes How many number of states will be there in minimal DFA for the regular expression a* b* c* d* ?? atul_21 asked Jul 9, 2017 atul_21 1.2k views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply AnilGoudar commented Jul 9, 2017 reply Follow Share dfa will have 6 states with one non final state, plz correct me if iam wrong, 0 votes 0 votes Arnab Bhadra commented Jul 9, 2017 reply Follow Share Bro i think five states are sufficient Just have a look my answer I have corrected it. Correct me if I am wrong 0 votes 0 votes AnilGoudar commented Jul 9, 2017 reply Follow Share Yes, the first state can be eliminated in my answer. 0 votes 0 votes Please log in or register to add a comment.
Best answer 1 votes 1 votes Total 5 states DFA is required. Below is the DFA Arnab Bhadra answered Jul 9, 2017 • selected Jul 10, 2017 by atul_21 Arnab Bhadra comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments joshi_nitish commented Jul 9, 2017 reply Follow Share @ Arnab, just one more transition delta(C,c)=C....else you dfa is correct... 0 votes 0 votes Arnab Bhadra commented Jul 9, 2017 reply Follow Share Thanks Bro I have edited the pic 0 votes 0 votes atul_21 commented Jul 10, 2017 reply Follow Share Thank to all of you 0 votes 0 votes Please log in or register to add a comment.
