Fixed javadoc failures

Author: misberner

util/src/main/java/net/automatalib/util/automata/minimizer/hopcroft/HopcroftMinimization.java

@@ -139,7 +139,6 @@ CompactMealy<I,O> minimizeMealy(A mealy, PruningMode pruningMode) {
 	 * Pruning (see above) is performed after computing state equivalences.
 	 * 
 	 * @param mealy the Mealy machine to minimize
-	 * @param pruningMode the pruning mode (see above)
 	 * @return a minimized version of the specified Mealy machine
 	 */
 	public static <I,O,A extends MealyMachine<?, I, ?, O> & InputAlphabetHolder<I>>

util/src/main/java/net/automatalib/util/automata/random/RandomICAutomatonGenerator.java

@@ -195,8 +195,8 @@ public final RandomICAutomatonGenerator<SP, TP> withTransitionProperties(TP ...p
 	 * parameters. Note that the automaton will <b>not</b> be minized.
 	 * 
 	 * @param numStates the number of states of the resulting automaton
-	 * @param alphabet the input symbols to consider during generation
-	 * @param the result automaton (should be empty)
+	 * @param inputs the input symbols to consider during generation
+	 * @param result the result automaton (should be empty)
 	 * @param r the randomness source
 	 * @return the result automaton 
 	 */

util/src/main/java/net/automatalib/util/partitionrefinement/Block.java

@@ -69,7 +69,7 @@ static Iterator<Block> blockListIterator(Block start) {
 	 * belong to a potential sub-class of this block, and those that do not or have not been checked.
 	 * <p>
 	 * This variable will be maintained such that either <code>ptr == -1</code>, or
-	 * <code>{@link #low} <= ptr <= {@link #high}</code>.
+	 * <code>{@link #low} &lt;= ptr &lt;= {@link #high}</code>.
 	 */
 	public int ptr = -1;
 	/**
@@ -119,8 +119,8 @@ public boolean isEmpty() {
 	 * Splits this block, if applicable. If this block cannot be split, {@code null}
 	 * is returned.
 	 * <p>
-	 * A new block (the split result) is created if both <code>{@link #ptr} > {@link #low}</code>
-	 * and <code>{@link #ptr} < {@link #high}</code>. This new block will contain either the elements
+	 * A new block (the split result) is created if both <code>{@link #ptr} &gt; {@link #low}</code>
+	 * and <code>{@link #ptr} &lt; {@link #high}</code>. This new block will contain either the elements
 	 * between {@link #low} (inclusive) and {@link #ptr} (exclusive), or between {@link #ptr} (inclusive)
 	 * and {@link #high} (exclusive), depending on whichever range is smaller. This block will be updated
 	 * to contain the remaining elements.

util/src/main/java/net/automatalib/util/partitionrefinement/PaigeTarjan.java

@@ -128,8 +128,8 @@ public static enum WorklistPolicy {
 	 * {@code j}, where <code>0 &lt;= i &lt; {@link #numStates}</code> and
 	 * <code>0 &lt;= j &lt; {@link #numInputs}</code>, the {@code j}-predecessors of {@code i} are
 	 * the elements of {@link #predData} from index
-	 * <code>{@link #predOfsData}[{@link #predOfsDataLow + j*{@link #numStates} + i]</code>, inclusive, to index
-	 * <code>{@link #predOfsData}[{@link #predOfsDataLow + j*{@link #numStates} + i + 1]</code>, exclusive.
+	 * <code>{@link #predOfsData}[{@link #predOfsDataLow} + j*{@link #numStates} + i]</code>, inclusive, to index
+	 * <code>{@link #predOfsData}[{@link #predOfsDataLow} + j*{@link #numStates} + i + 1]</code>, exclusive.
 	 */
 	public int[] predData;