code: public static <I> void stateCover(DeterministicAutomaton<?, I, ?> automaton,
                                        Collection<? extends I> inputs,
                                        Collection<? super Word<I>> states) {
          cover(automaton, inputs, states::add, w -> {});
      }
docs: Computes a state cover for a given automaton.
  <p>
  A state cover is a set <i>C</i> of input sequences, such that for each state <i>s</i> of an automaton, there
  exists an input sequence in <i>C</i> that transitions the automaton from its initial state to state s.
  <p>
  Note: if restrictions on the {@code inputs} parameter do not allow to reach certain states, the computed cover is
  not complete.
  
  @param automaton
  the automaton for which the cover should be computed
  @param inputs
  the set of input symbols allowed in the cover sequences
  @param states
  the collection in which the sequences will be stored
  @param <I>
  input symbol type