  In this paper, we investigate the structure of the most general kind of
substitution shifts, including non-minimal ones, and allowing erasing
morphisms. We prove the decidability of many properties of these morphisms with
respect to the shift space generated by iteration, such as aperiodicity,
recognizability and (under an additional assumption) irreducibility, or
minimality.
