code: public static <S, I, O> int computeEffectiveResets(final ADTNode<S, I, O> adt) {
          return computeEffectiveResetsInternal(adt, 0);
      }
docs: Computes how often reset nodes are encountered when traversing from the given node to the leaves of the induced
  subtree of the given node.
  
  @param adt
  the node whose subtree should be analyzed
  @param <S>
  (hypothesis) state type
  @param <I>
  input alphabet type
  @param <O>
  output alphabet type
  
  @return the number of encountered reset nodes