0 votes 0 votes Do we have any shortcut for minimization of dfa Theory of Computation theory-of-computation finite-automata + – Jose Kj asked Jan 24, 2016 Jose Kj 1.1k views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Gaurav Sharma commented Jan 24, 2016 reply Follow Share What method you are aware of for minimizing the DFA? 0 votes 0 votes shivanisrivarshini commented Jan 27, 2016 reply Follow Share what i know was getting 0-equivalent,1-equivalent ...... but its length is their any short way for having minimized dfa ?? 0 votes 0 votes Praveen Saini commented Jan 27, 2016 reply Follow Share https://gateoverflow.in/37795/dfa-min-states You may follow that way used in last table, if for two states (either both final or both nonfinal states) if both rows are same in table then remove one. and replace that (removed) state in transitions table by its equivalent one. 0 votes 0 votes Please log in or register to add a comment.