On the retracts and recodings of continuing codes

DOI10.4134/BKMS.2015.52.4.1375zbMATH Open1358.37034arXiv1307.7412MaRDI QIDQ2949412FDOQ2949412

Authors: Jisang Yoo 

Publication date: 8 October 2015

Published in: Bulletin of the Korean Mathematical Society (Search for Journal in Brave)

Abstract: We investigate what happens when we try to work with continuing block codes (i.e. left or right continuing factor maps) between shift spaces that may not be shifts of finite type. For example, we demonstrate that continuing block codes on strictly sofic shifts do not behave as well as those on shifts of finite type; a continuing block code on a sofic shift need not have a uniformly bounded retract, unlike one on a shift of finite type. A right eresolving code on a sofic shift can display any behavior arbitrary block codes can have. We also show that a right continuing factor of a shift of finite type is always a shift of finite type.

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

Recommendations

• On the existence of open and bi-continuing codes
• Sliding block codes between shift spaces over infinite alphabets
• Completing codes in a sofic shift
• Complete Codes in a Sofic Shift
• Open maps between shift spaces

zbMATH Keywords

factor mapinfinite-to-one coderight-continuing code

Mathematics Subject Classification ID

Symbolic dynamics (37B10) Other types of codes (94B60)

Cited In (6)

• On the existence of open and bi-continuing codes
• On factor maps that send Markov measures to Gibbs measures
• On semi-open codes and bi-continuing almost everywhere codes
• Loss of Gibbs property in one-dimensional mixing shifts of finite type
• On continuous coding
• Suberesolving codes

This page was built for publication: On the retracts and recodings of continuing codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2949412)