Definition: Let M = (Q, S, R, s, F) be a complete DFA.
Then, M is well-specified FA (WSFA) if:
1) Q has no inaccessible state
2) Q has no more than one nonterminating state
Note:
If well-specified FA has one nonterminating state, then it is qfalse from
the previous algorithm.
Theorem: For every FA M, there is
an equivalent WSFA Mws.
Proof: Use the next algorithm.
Well-Specified FA
34/44