search
Log In
0 votes
160 views
When we convert a (minimal) NFA to DFA by subset construction method, is the DFA obtained always a minimal DFA?

Please elaborate.
in Theory of Computation 160 views
1
If so then what is the use of "DFA Minimization" algorithm given on TOC textbook?
0
Ooh I see. Thanks @Arjun!
1
That was quite helpful, thanks @Shamim!

1 Answer

2 votes
 
Best answer
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.

selected by
0
Thanks @JEET!

Related questions

2 votes
1 answer
3
505 views
Minimum number of states required to construct DFA accepting language L={ w | w has even no of 0's and 1's and odd no of 3's } over alphabet { 0,1,2,3 } The answer given is 8. Should not the ans be 16? Using the concept of combinations there are 2 ... is fixed and 2 can take either one. Is it possible to get 8 states after minimization for the above DFA? Any simpler way of finding that logically?
asked Jan 1, 2017 in Theory of Computation yg92 505 views
1 vote
1 answer
4
...