arXiv · 1502.06262
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Daniel Gonçalves, Marcelo Sobottka, Charles Starling. 2017-02-14. Sliding block codes between shift spaces over infinite alphabets. https://doi.org/10.1002/mana.201500309
Cite the original work for its findings. Save a collection to share your selection of sources.