Automata

```
public class Automata
extends java.lang.Object
```
Automata : a finite Mealy state machine is made of a set of States among which a set of final States and an initial state, a set of (Mealy)Labels attached to the states, the transition relation is a set of (outgoing)transitions going from the states and reaching other states.

Constructors
Constructor and Description
`Automata()` Constructor

Methods
Modifier and Type	Method and Description
`void`	`addFinalState(State fst)`
`void`	`addState(State st)`
`void`	`addTransition(State ist, MealyLabel mlbl, State fst)`
`StateSpaceContext`	`getContext()`
`java.util.HashSet<State>`	`getFinalStates()`
`State`	`getInitialState()` the methods to explore the automata
`boolean`	`isFinalState(State cs)`
`boolean`	`isInitialState(State cs)`
`State`	`moveNextState(StateLabelledTransition slbl)`
`void`	`setCurrentState(State cst)`
`void`	`setInitialState(State ist)`
`java.lang.String`	`toString()`

Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

public void setInitialState(State ist)

public void setCurrentState(State cst)

public void addTransition(State ist,
                 MealyLabel mlbl,
                 State fst)

getInitialState
```
public State getInitialState()
```
the methods to explore the automata

public java.util.HashSet<State> getFinalStates()

public boolean isInitialState(State cs)

public boolean isFinalState(State cs)

public State moveNextState(StateLabelledTransition slbl)

Class Automata