On semi-open codes and bi-continuing almost everywhere codes

DOI10.1016/J.TOPOL.2019.106872MaRDI QIDQ2291583zbMATH OpenOpenAlexWikidataFDO

Authors Dawoud Ahmadi Dastjerdi, S. Jangjooye Shaldehi

Publication date 31 January 2020

Published in Topology and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

continuing codeshift of finite typesofic shiftsynchronization

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Symbolic dynamics (37B10) Topological entropy (37B40) Multidimensional shifts of finite type (37B51) Extremally disconnected spaces, (F)-spaces, etc. (54G05)

Abstract: We will show that a system is synchronized if and only if it has a cover whose cover map is semi-open. Also, any factor code on an irreducible sofic shift is semi-open and the image of a synchronized system by a semi-open code is synchronized. On the other side, right-closing semi-open extension of an irreducible shift of finite type is of finite type. Moreover, we give conditions on finite-to-one factor codes to be open and show that any semi-open code on a synchronized system is bi-continuing a.e.. We give some sufficient conditions for a right-continuing a.e. factor code being right-continuing everywhere.

Recommendations

• On the existence of open and bi-continuing codes
• scientific article; zbMATH DE number 177153
• On half-synchronized systems
• scientific article; zbMATH DE number 177154
• On the retracts and recodings of continuing codes

Cites work

• An Introduction to Symbolic Dynamics and Coding
• Computations on sofic \(S\)-gap shifts
• scientific article; zbMATH DE number 3745547 (Why is no real title available?)
• scientific article; zbMATH DE number 177154 (Why is no real title available?)
• scientific article; zbMATH DE number 193253 (Why is no real title available?)
• scientific article; zbMATH DE number 3102165 (Why is no real title available?)
• Infinite-to-One Codes and Markov Measures
• Limit sets of stable cellular automata
• On absolute retracts of ω*
• On the existence of open and bi-continuing codes
• Open maps between shift spaces
• Set of periods of additive cellular automata
• Sufficient conditions under which a transitive system is chaotic
• Systèmes codés. (Coded systems)

Cited in

(5)

• Invariants for subshifts via nested sequences of shifts of finite type
• On the existence of open and bi-continuing codes
• Open maps between shift spaces
• Suberesolving codes
• Totally synchronizing generated system

This page was built for publication: On semi-open codes and bi-continuing almost everywhere codes

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