0 votes 0 votes When we convert a (minimal) NFA to DFA by subset construction method, is the DFA obtained always a minimal DFA? Please elaborate. Theory of Computation finite-automata theory-of-computation minimal-state-automata + – Mizuki asked Nov 14, 2018 Mizuki 1.0k views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Arjun commented Nov 14, 2018 reply Follow Share If so then what is the use of "DFA Minimization" algorithm given on TOC textbook? 1 votes 1 votes Mizuki commented Nov 14, 2018 reply Follow Share Ooh I see. Thanks @Arjun! 0 votes 0 votes Shamim Ahmed commented Nov 15, 2018 reply Follow Share No not always. Refer to this answer:- https://cs.stackexchange.com/questions/87189/does-nfa-to-dfa-conversion-give-the-minimal-dfa-as-result 1 votes 1 votes Mizuki commented Nov 15, 2018 reply Follow Share That was quite helpful, thanks @Shamim! 1 votes 1 votes Please log in or register to add a comment.
Best answer 2 votes 2 votes No, it's not. It may be or may not be. In most of the cases, it won't be. Hence, we use Minimization method to generate the minimized DFA. `JEET answered Nov 14, 2018 selected Nov 15, 2018 by Mizuki `JEET comment Share Follow See 1 comment See all 1 1 comment reply Mizuki commented Nov 15, 2018 reply Follow Share Thanks @JEET! 0 votes 0 votes Please log in or register to add a comment.