Weak equivalence for shifts of finite type ✩

We derive a computable set of necessary and sufficient conditions for the existence of a homomorphism from one shift of finite type to another. Also we consider an equivalence relation on subshifts, called weak equivalence, which was introduced and studied by Beal and Perrin. We classify arbitrary shifts of finite type up to weak equivalence.