1. Mark the start state as "reachable".
2. For every reachable state, mark all states that can be reached from that state by doing one transition as "reachable".
3. Repeat step 2 until no further states get marked "reachable".
4. The accepted language is empty if and only if no final state is reachable.