Sliding block codes between shift spaces over infinite alphabets

DOI10.1002/mana.201500309zbMath1375.37037arXiv1502.06262OpenAlexW1728991103MaRDI QIDQ2953708

Charles Starling, Daniel Gonçalves, Marcelo Sobottka

Publication date: 5 January 2017

Published in: Mathematische Nachrichten (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.06262

zbMATH Keywords

symbolic dynamicsCurtis-Hedlund-Lyndon theoremOtt-Tomforde-Willis shift space

Mathematics Subject Classification ID

Dynamical aspects of cellular automata (37B15) Symbolic dynamics (37B10) Combinatorial codes (94B25)

Related Items (11)

Inverse semigroup shifts over countable alphabets ⋮ KMS states and continuous orbit equivalence for ultragraph shift spaces with sinks ⋮ Some notes on the classification of shift spaces: shifts of finite type; sofic shifts; and finitely defined shifts ⋮ On the image set and reversibility of shift morphisms over discrete alphabets ⋮ TWO-SIDED SHIFT SPACES OVER INFINITE ALPHABETS ⋮ Cellular automata on group sets and the uniform Curtis-Hedlund-Lyndon theorem ⋮ Ultragraphs and shift spaces over infinite alphabets ⋮ Blur shift spaces ⋮ Li-Yorke chaos for ultragraph shift spaces ⋮ Continuous shift commuting maps between ultragraph shift spaces ⋮ Ultragraph shift spaces and chaos

Cites Work

• Symbolic dynamics. One-sided, two-sided and countable state Markov shifts
• Factor maps, entropy and fiber cardinality for Markov shifts
• Cellular Automata and Groups
• Graphs with pre-assigned Salama entropies and optimal degrees for locally compact Markov shifts
• TWO-SIDED SHIFT SPACES OVER INFINITE ALPHABETS
• Embedding theorems for locally compact Markov shifts
• Topological Boundaries for Countable State Markov Shifts
• An Introduction to Symbolic Dynamics and Coding

This page was built for publication: Sliding block codes between shift spaces over infinite alphabets