Internally, the automaton has different "states" it can be in. Feeding it input may (or may not) change its state. That way, the automaton goes through all the input, consuming one item (which mathematicians call a symbol) at a time. When no symbol is left, the automaton is in a certain state. This may be an "final state". In this case the input is accepted. Otherwise, the input is rejected.