0 votes 0 votes closed with the note: Query resolved. Correct answer is 3. The Minimum DFA that accepts the given language is ____ L = { w | w is any string not in a*b*} Theory of Computation theory-of-computation finite-automata minimal-state-automata + – VikramRB asked Jan 5, 2019 closed Jan 5, 2019 by VikramRB VikramRB 4.1k views comment Share Follow See all 11 Comments See all 11 11 Comments reply prashant jha 1 commented Jan 5, 2019 reply Follow Share 4? 0 votes 0 votes Verma Ashish commented Jan 5, 2019 reply Follow Share Yes it should be 4 0 votes 0 votes prashant jha 1 commented Jan 5, 2019 reply Follow Share Is the procedure ok ? @Verma Ashish . You can create a DFA for a*b* including the rejected state , and then complement it by making all final as non-final and vice versa. 0 votes 0 votes Verma Ashish commented Jan 5, 2019 reply Follow Share Yes.. Whatever way we do final minimal dfa is same. 0 votes 0 votes Chandrabhan Vishwa 1 commented Jan 5, 2019 reply Follow Share only three state 1 votes 1 votes Kunal Kadian commented Jan 5, 2019 reply Follow Share 4 se kum mei naa ho payega 0 votes 0 votes prashant jha 1 commented Jan 5, 2019 reply Follow Share Yeah 0 votes 0 votes Chandrabhan Vishwa 1 commented Jan 5, 2019 reply Follow Share when we are minimize the dfa then over all three state in this case q2 and q3 merge 1 votes 1 votes VikramRB commented Jan 5, 2019 reply Follow Share I got the answer as 4 too but this the solution that they provided. Someone please confirm whether it is correct or not 2 votes 2 votes Chandrabhan Vishwa 1 commented Jan 5, 2019 reply Follow Share 100% true 1 votes 1 votes Verma Ashish commented Jan 5, 2019 reply Follow Share oh yes ..my mistake. given solution is correct. 1 votes 1 votes Please log in or register to add a comment.