Definition of Turing machines and rejection states
A deterministic Turing machine accepts if, and only if, it terminates in an accepting state. Any state that is not accepting is rejecting by default.  There are various equivalent ways of defining Turing machines: for example, instead of having a HALT instruction and accepting and rejecting states, you could have explicit ACCEPT and REJECT instructions.