Automata indentation and link (#1425)

* finite automata example

* indentation and link

algorithms/src/main/java/com/baeldung/automata/FiniteStateMachine.java

@@ -5,12 +5,12 @@ package com.baeldung.automata;
  */
 public interface FiniteStateMachine {
 
-	/**
-	 * Follow a transition, switch the state of the machine.
-	 * @param c Char.
-	 * @return A new finite state machine with the new state.
-	 */
-	FiniteStateMachine switchState(final CharSequence c);
+    /**
+     * Follow a transition, switch the state of the machine.
+     * @param c Char.
+     * @return A new finite state machine with the new state.
+     */
+    FiniteStateMachine switchState(final CharSequence c);
 
     /**
      * Is the current state a final one?

algorithms/src/main/java/com/baeldung/automata/RtFiniteStateMachine.java

@@ -6,25 +6,25 @@ package com.baeldung.automata;
  */
 public final class RtFiniteStateMachine implements FiniteStateMachine {
 
-	/**
-	 * Current state.
-	 */
-	private State current;
+    /**
+     * Current state.
+     */
+    private State current;
 
-	/**
-	 * Ctor.
-	 * @param initial Initial state of this machine.
-	 */
-	public RtFiniteStateMachine(final State initial) {
-		this.current = initial;
-	}
+    /**
+     * Ctor.
+     * @param initial Initial state of this machine.
+     */
+    public RtFiniteStateMachine(final State initial) {
+        this.current = initial;
+    }
 
-	public FiniteStateMachine switchState(final CharSequence c) {
-		return new RtFiniteStateMachine(this.current.transit(c));
-	}
+    public FiniteStateMachine switchState(final CharSequence c) {
+        return new RtFiniteStateMachine(this.current.transit(c));
+    }
 
-	public boolean canStop() {
-		return this.current.isFinal();
-	}
+    public boolean canStop() {
+        return this.current.isFinal();
+    }
 
 }

algorithms/src/main/java/com/baeldung/automata/RtState.java

@@ -33,10 +33,10 @@ public final class RtState implements State {
         return this.isFinal;
     }
 
-	@Override
-	public State with(Transition tr) {
-		this.transitions.add(tr);
-		return this;
-	}
+    @Override
+    public State with(Transition tr) {
+        this.transitions.add(tr);
+        return this;
+    }
 
 }

algorithms/src/main/java/com/baeldung/automata/RtTransition.java

@@ -6,26 +6,26 @@ package com.baeldung.automata;
  */
 public final class RtTransition implements Transition {
 
-	private String rule;
-	private State next;
-	
-	/**
-	 * Ctor.
-	 * @param rule Rule that a character has to meet 
-	 *  in order to get to the next state.  
-	 * @param next Next state.
-	 */
-	public RtTransition (String rule, State next) {
-		this.rule = rule;
-		this.next = next;
-	}
-	
-	public State state() {
-		return this.next;
-	}
+    private String rule;
+    private State next;
+    
+    /**
+     * Ctor.
+     * @param rule Rule that a character has to meet 
+     *  in order to get to the next state.  
+     * @param next Next state.
+     */
+    public RtTransition (String rule, State next) {
+        this.rule = rule;
+        this.next = next;
+    }
+    
+    public State state() {
+        return this.next;
+    }
 
-	public boolean isPossible(CharSequence c) {
-		return this.rule.equalsIgnoreCase(String.valueOf(c));
-	}
+    public boolean isPossible(CharSequence c) {
+        return this.rule.equalsIgnoreCase(String.valueOf(c));
+    }
 
 }

algorithms/src/main/java/com/baeldung/automata/State.java

@@ -5,12 +5,12 @@ package com.baeldung.automata;
  */
 public interface State {
 
-	/**
-	 * Add a Transition to this state.
-	 * @param tr Given transition.
-	 * @return Modified State.
-	 */
-	State with(final Transition tr);
+    /**
+     * Add a Transition to this state.
+     * @param tr Given transition.
+     * @return Modified State.
+     */
+    State with(final Transition tr);
 
     /**
      * Follow one of the transitions, to get 

algorithms/src/main/java/com/baeldung/automata/Transition.java

@@ -5,16 +5,16 @@ package com.baeldung.automata;
  */
 public interface Transition {
 
-	/**
-	 * Is the transition possible with the given character?
-	 * @param c char.
-	 * @return true or false.
-	 */
-	boolean isPossible(final CharSequence c);
+    /**
+     * Is the transition possible with the given character?
+     * @param c char.
+     * @return true or false.
+     */
+    boolean isPossible(final CharSequence c);
 
-	/**
-	 * The state to which this transition leads.
-	 * @return State.
-	 */
+    /**
+     * The state to which this transition leads.
+     * @return State.
+     */
     State state();
 }