code: public static <I> boolean incrementalTransitionCover(DeterministicAutomaton<?, I, ?> automaton,
                                                           Collection<? extends I> inputs,
                                                           Collection<? extends Word<I>> oldTransCover,
                                                           Collection<? super Word<I>> newTransCover) {
          final int oldTransSize = newTransCover.size();
  
          incrementalCover(automaton, inputs, Collections.emptySet(), oldTransCover, w -> {}, newTransCover::add);
  
          return oldTransSize < newTransCover.size();
      }
docs: Computes an incremental transition cover for a given automaton, i.e. a cover that only contains the missing
  sequences for obtaining a complete transition cover.
  
  @param automaton
  the automaton for which the cover should be computed
  @param inputs
  the set of input symbols allowed in the cover sequences
  @param oldTransCover
  the collection containing the already existing sequences of the transition cover
  @param newTransCover
  the collection in which the missing sequences will be stored
  @param <I>
  input symbol type
  
  @return {@code true} if new sequences have been added to the state cover, {@code false} otherwise.
  
  @see #transitionCover(DeterministicAutomaton, Collection, Collection)