Original: An FSM is a machine that takes a symbol as input and "jumps" or transitions, from one state to another according to a transition function (which can be expressed as a table).
Simplified: An Automaton (one automaton, several automata) is a concept from mathematics.