The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
71 views
When we convert a (minimal) NFA to DFA by subset construction method, is the DFA obtained always a minimal DFA?

Please elaborate.
asked in Theory of Computation by Active (1.3k points) | 71 views
+1
If so then what is the use of "DFA Minimization" algorithm given on TOC textbook?
0
Ooh I see. Thanks @Arjun!
+1
+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.
answered by Active (3.3k points)
selected by
0
Thanks @JEET!

Related questions

+1 vote
2 answers
2
0 votes
1 answer
6
asked Nov 3, 2018 in Theory of Computation by Na462 Loyal (6.6k points) | 54 views
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
49,814 questions
54,518 answers
188,351 comments
75,293 users