7 votes 7 votes Theory of Computation theory-of-computation minimal-state-automata finite-automata + – Kapil asked Aug 11, 2016 Kapil 5.7k views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply papesh commented Aug 11, 2016 reply Follow Share Ans is right 0 votes 0 votes Sanandan commented Oct 5, 2020 reply Follow Share 3 states in the minimized DFA 0 votes 0 votes Please log in or register to add a comment.
Best answer 4 votes 4 votes States are {Q0} {Q1,Q2,Q3} {Q4} . Hence, minimized DFA has 3 states. RE = (a+b) b*a (a+b)* Aboveallplayer answered Aug 11, 2016 selected Aug 12, 2016 by Kapil Aboveallplayer comment Share Follow See all 7 Comments See all 7 7 Comments reply Show 4 previous comments Kapil commented Aug 11, 2016 reply Follow Share Yes, they are combined. 0 votes 0 votes Kapil commented Aug 12, 2016 reply Follow Share Thanks, @vijaycs for correction :) 1 votes 1 votes Aboveallplayer commented Aug 12, 2016 reply Follow Share Yes GAbbar singh,, you are correct :D 1 votes 1 votes Please log in or register to add a comment.
4 votes 4 votes Ans is 3 partition will be {q0},(q1q2q3},{q4] Prashant. answered Aug 11, 2016 edited Aug 12, 2016 by Prashant. Prashant. comment Share Follow See all 2 Comments See all 2 2 Comments reply vijaycs commented Aug 12, 2016 reply Follow Share {q0}, {q1q2q3}, {q4}. 0 votes 0 votes Kapil commented Aug 12, 2016 reply Follow Share Thanks, @Anirudh, nice explaination. 0 votes 0 votes Please log in or register to add a comment.