Back to Automaton algorithms
The closure of a state S of a finite-state automaton under the relation ~ is the set of states that can be reached from S by following the transitions.