<s>
In	O
automata	B-Application
theory	I-Application
(	O
a	O
branch	O
of	O
theoretical	O
computer	O
science	O
)	O
,	O
NFA	B-General_Concept
minimization	I-General_Concept
is	O
the	O
task	O
of	O
transforming	O
a	O
given	O
nondeterministic	B-General_Concept
finite	I-General_Concept
automaton	I-General_Concept
(	O
NFA	O
)	O
into	O
an	O
equivalent	O
NFA	O
that	O
has	O
a	O
minimum	O
number	O
of	O
states	O
,	O
transitions	O
,	O
or	O
both	O
.	O
</s>
<s>
While	O
efficient	O
algorithms	O
exist	O
for	O
DFA	B-General_Concept
minimization	I-General_Concept
,	O
NFA	B-General_Concept
minimization	I-General_Concept
is	O
PSPACE-complete	O
.	O
</s>
<s>
Unlike	O
deterministic	B-General_Concept
finite	I-General_Concept
automata	I-General_Concept
,	O
minimal	O
NFAs	O
may	O
not	O
be	O
unique	O
.	O
</s>
<s>
There	O
may	O
be	O
multiple	O
NFAs	O
of	O
the	O
same	O
size	O
which	O
accept	O
the	O
same	O
regular	B-General_Concept
language	I-General_Concept
,	O
but	O
for	O
which	O
there	O
is	O
no	O
equivalent	O
NFA	O
or	O
DFA	B-General_Concept
with	O
fewer	O
states	O
.	O
</s>
