“…Substitutions on infinite alphabets and tilings with infinite local complexity (ILC) have been steadily gaining attention in the study of symbolic dynamics and aperiodic order [10,16,19,28,34,35]. Indeed, infinite alphabets must naturally be considered when recoding non-uniformly recurrent sequences by return words [11], or when performing the balanced-pair and overlap algorithms for a non-Pisot substitution [21]. In the context of automatic sequences, constant-length substitutions on infinite alphabets are the natural setting for regular sequences-sequences admitting a finitely-generated k-kernel [2,Thm.…”