cleanup ADT documentation

Author: mtf90

algorithms/active/adt/src/main/java/de/learnlib/algorithm/adt/ads/DefensiveADS.java

@@ -37,15 +37,17 @@
 import net.automatalib.common.smartcollection.ReflexiveMapView;
 import net.automatalib.common.util.HashUtil;
 import net.automatalib.common.util.Pair;
+import net.automatalib.util.automaton.ads.ADS;
 import net.automatalib.util.automaton.ads.ADSUtil;
+import net.automatalib.util.automaton.ads.BacktrackingSearch;
 import net.automatalib.word.Word;
 import org.checkerframework.checker.nullness.qual.NonNull;
 import org.checkerframework.checker.nullness.qual.Nullable;
 
 /**
- * A variant of the backtracking ADS search (see {@link net.automatalib.util.automaton.ads.ADS}, {@link
- * net.automatalib.util.automaton.ads.BacktrackingSearch}), that works on partially defined automata. It tries to find an
- * ADS based on defined transitions and successively closes transitions if no ADS has been found.
+ * A variant of the backtracking ADS search (see {@link ADS}, {@link BacktrackingSearch}), that works on partially
+ * defined automata. It tries to find an ADS based on defined transitions and successively closes transitions if no ADS
+ * has been found.
  *
  * @param <S>
  *         (hypothesis) state type

algorithms/active/adt/src/main/java/de/learnlib/algorithm/adt/api/PartialTransitionAnalyzer.java

@@ -17,7 +17,7 @@
 
 /**
  * During the refinement process of the hypothesis, ADS/Ts may be computed on partially defined automata. These
- * computations may want to skip undefined transitions (as closing them results in resets, which we want to omit) and
+ * computations may want to skip undefined transitions (as closing them results in resets which we want to omit) and
  * only determine the information if necessary. This interface mediates between the learner and ADS/T computations by
  * defining the basic forms of communication.
  *

algorithms/active/adt/src/main/java/de/learnlib/algorithm/adt/model/ExtensionResult.java

@@ -22,10 +22,14 @@
 import org.checkerframework.checker.nullness.qual.Nullable;
 
 /**
- * A class that describes the possible result a {@link ADTExtender} can return. Extending a parent trace can either <ul>
- * <li> yield a counterexample, if the output of the parent trace does not match the output of the hypothesis states of
- * the leaves </li> <li> yield a valid replacement for the temporary splitter </li> <li> yield no result, if the
- * referenced hypothesis states cannot be distinguished by means of extending the parent trace </li> </ul>
+ * A class that describes the possible result an {@link ADTExtender} can return. Extending a parent trace can either
+ * <ul>
+ *      <li>yield a counterexample, if the output of the parent trace does not match the output of the hypothesis
+ *      states of the leaves.</li>
+ *      <li>yield a valid replacement for the temporary splitter.</li>
+ *      <li>yield no result, if the referenced hypothesis states cannot be distinguished by means of extending the
+ *      parent trace.</li>
+ * </ul>
  *
  * @param <S>
  *         (hypothesis) state type