2000 character limit reached
    
  Sliding block codes between shift spaces over infinite alphabets (1502.06262v3)
    Published 22 Feb 2015 in math.DS and math.OA
  
  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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.