The Gateway to Computer Science Excellence
+1 vote
501 views
in Theory of Computation by Active (1.2k points) | 501 views

1 Answer

+2 votes
No, it is not in general minimal. The standard determinization procedure, the subset construction, always converts an NFA with n states to a DFA with 2^n states and there is no reason that this should be minimal.

In practical terms, if you convert an NFA, you'll often find that there are unreachable states in the resulting DFA, which immediately shows that the result is not minimal. For a more extreme example, take any DFA with n states, call it an NFA and determinize it. You now have a DFA with 2^n>n states that accepts the same language as it did before, so it's certainly not minimal.
by Active (1.7k points)
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
50,737 questions
57,257 answers
198,086 comments
104,735 users