<p>A specific subcategory of shift spaces over a finite alphabet includes only sofics, utilizing sliding block codes (SBCs) as morphisms. Efforts have been made to extend this subcategory and SBCs to shift spaces with infinite characters. We demonstrate the shortcomings of current extensions with examples and propose a class of SBCs that should be considered for shift spaces over infinite alphabets in order to resolve these issues. We demonstrate that shifts of finite type can lack the property of nested cylinders, differing from previous findings.</p>