The input string abc has been recognized because the last character was used to reach the final state.
The set of strings that are accepted by a particular finite-state automaton is called the language accepted by the automaton. (Or, sometimes, it is called the language defined by the automaton).
What is the language defined by the example automaton?