The extended transition function describes the state reached by an automaton after processing an entire input string. It is defined recursively over the length of the string:
Intuitively, is the state the automaton is in after starting in state and reading all symbols of sequentially.