3 votes 3 votes The minimum number of states needed for DFA of langauge L is ________. Kaluti asked Jan 23, 2018 Kaluti 979 views answer comment Share Follow See all 23 Comments See all 23 23 Comments reply Akshay Koli 4 commented Jan 23, 2018 reply Follow Share is it 5? 0 votes 0 votes Surajit commented Jan 23, 2018 reply Follow Share does it mean a and b both even or both are odd??... 0 votes 0 votes Anup patel commented Jan 23, 2018 reply Follow Share Ans Will be 2 It Simply Means Length of String is Even 0 votes 0 votes MiNiPanda commented Jan 23, 2018 reply Follow Share But a's should not come after b's 1 votes 1 votes braindead commented Jan 23, 2018 reply Follow Share I am also getting 5 0 votes 0 votes MiNiPanda commented Jan 23, 2018 reply Follow Share Yes same here.. 0 votes 0 votes Anup patel commented Jan 23, 2018 reply Follow Share @ MiNiPanda thanks Bro ... I had mis readed the Question 0 votes 0 votes braindead commented Jan 23, 2018 reply Follow Share Is this correct? 3 votes 3 votes MiNiPanda commented Jan 23, 2018 i edited by MiNiPanda Jan 23, 2018 reply Follow Share @Anup patel welcome bro :P @braindead Very nice :) and please mention the dead state.. 1 votes 1 votes Anup patel commented Jan 23, 2018 reply Follow Share @ braindead It is Wrong ... It is accepting : aabbaabb It is not in language 1 votes 1 votes MiNiPanda commented Jan 23, 2018 reply Follow Share Hmmm.. right.. :/ 0 votes 0 votes braindead commented Jan 23, 2018 reply Follow Share Oh right Anup. Thanks. What is the correct diagram? 0 votes 0 votes Akshay Koli 4 commented Jan 23, 2018 reply Follow Share make self loop on final state[last final state] on alphabet b and draw the dead state. 0 votes 0 votes MiNiPanda commented Jan 23, 2018 reply Follow Share Making a self loop means it would accept any no. Of b's. But we have to keep the total even only right? 1 votes 1 votes braindead commented Jan 23, 2018 reply Follow Share @Anup I think it will need 6 states 0 votes 0 votes Utsav09 commented Jan 23, 2018 reply Follow Share 6 states leaving the dead states 0 votes 0 votes braindead commented Jan 23, 2018 reply Follow Share It's not a DFA if you don't show dead states 0 votes 0 votes Utsav09 commented Jan 23, 2018 i edited by Utsav09 Jan 23, 2018 reply Follow Share can a state in dfa have multiple incoming edges? 0 votes 0 votes Utsav09 commented Jan 23, 2018 reply Follow Share 7 states? 0 votes 0 votes braindead commented Jan 23, 2018 reply Follow Share can a "state" in dfa have multiple incoming edges? - Yes 0 votes 0 votes Utsav09 commented Jan 23, 2018 reply Follow Share my dfa is corrrect? i checked it for as many accepting strings as possible 0 votes 0 votes Utsav09 commented Jan 23, 2018 reply Follow Share also the starting state is final state too 0 votes 0 votes Anu007 commented Jan 23, 2018 reply Follow Share i think 5 is enough 4 votes 4 votes Please log in or register to add a comment.
Best answer 0 votes 0 votes 5 states (with one dead state, two intermediate states, and two final states). Utsav09 answered Jan 23, 2018 • selected Jan 23, 2018 by Kaluti Utsav09 comment Share Follow See all 0 reply Please log in or register to add a comment.
