Decidability of Hierarchies of Regular Aperiodic Languages