We add to the classification of groups generated by 3-state automata over a 2-letter alphabet given by Bondarenko et al., by showing that a number of the groups in the classification are non-contracting. We show that the ...