Sliding block codes between shift spaces over infinite alphabets

Abstract

Recently Ott, Tomforde and Willis introduced a notion of one-sided shifts over infinite alphabets and proposed a definition for sliding block codes between such shift spaces. In this work we propose a more general definition for sliding block codes between Ott-Tomforde-Willis shift spaces and then we prove Curtis-Hedlund-Lyndon type theorems for them, finding sufficient and necessary conditions under which the class of the sliding block codes coincides with the class of continuous shift-commuting maps.

15 pages. Revised text

References in corpus (1)

• Two-sided shift spaces over infinite alphabets

Cited by in corpus (7)

• Two-sided shift spaces over infinite alphabets
• Cellular Automata on Group Sets and the Uniform Curtis-Hedlund-Lyndon Theorem
• A note on the definition of sliding block codes and the Curtis-Hedlund-Lyndon Theorem
• Some notes on the classification of shift spaces: Shifts of Finite Type; Sofic Shifts; and Finitely Defined Shifts
• Inverse semigroup shifts over countable alphabets
• Ultragraphs and shifts spaces over infinite alphabets
• The socle of subshift algebras, with applications to subshift conjugacy