Automata

An automaton is introduced by the Automaton keyword followed by the name of the automaton. Follow in that order states, final states and transitions.
The states are introduced by the States keyword followed by a list of the states names.
The final states are introduced by the Final States keyword followed by a list of the final states names.
The transitions are introduced by the Transitions keyword followed by a list of transitions. Each transition has a left-handside (a flat term with arguments being states) and a right-handside (a state) separated by ->.