code: public static <I> void transitionCover(DeterministicAutomaton<?, I, ?> automaton,
                                             Collection<? extends I> inputs,
                                             Collection<? super Word<I>> transitions) {
          cover(automaton, inputs, w -> {}, transitions::add);
      }
docs: Computes a transition cover for a given automaton.
  <p>
  A transition cover is a set <i>C</i> of input sequences, such that for each state <i>s</i> and each input symbol
  <i>i</i> of an automaton, there exists an input sequence in <i>C</i> that starts from the initial state of the
  automaton and ends with the transition that applies <i>i</i> to state <i>s</i>.
  <p>
  Note: if restrictions on the {@code inputs} parameter do not allow to reach certain transitions, 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 transitions
  the collection in which the sequences will be stored
  @param <I>
  input symbol type