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