  Given a deterministic finite automaton and its implementation with at most
one single fault, that we can test on a set of inputs, we provide an algorithm
to find a test set that guarantees finding whether the fault exists.
