Sliding block codes between shift spaces over infinite alphabets
Dynamical Systems
2018-02-15 v3 Operator Algebras
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.
Keywords
Cite
@article{arxiv.1502.06262,
title = {Sliding block codes between shift spaces over infinite alphabets},
author = {Daniel Gonçalves and Marcelo Sobottka and Charles Starling},
journal= {arXiv preprint arXiv:1502.06262},
year = {2018}
}
Comments
15 pages. Revised text