I don't understand your first question, maybe you can make that clearer? For the second question, the answer is found on page 86 of the automaton chapter: An automaton is totally defined if for every state and every input, there is a transition, otherwise, the automaton is partially defined. Partially defined automata have therefore states where they cannot react to one of the inputs since there is no transition for the input.