@pguillon

Sliding block codes between shift spaces over infinite alphabets

, , and . (2015)cite arxiv:1502.06262Comment: 15 pages. Revised text.

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.

Description

Sliding block codes between shift spaces over infinite alphabets

Links and resources

Tags