Definition:
Let
M
be a
WS
FA
. Then,
M
is
minimum-state
FA
if
M
contains only
distinguishable states.
Theorem:
For every
WSFA
M
, there is an
equivalent
minimum-state FA
M
m
Minimum-State FA
Proof:
Use
the next
algorithm.
38
/44