On the existence of open and bi-continuing codes
From MaRDI portal
Abstract: Given an irreducible sofic shift X, we show that an an irreducible SFT Y of lower entropy is a factor of X if and only if it is a factor of X by an open bi-continuing code. If these equivalent conditions hold and Y is mixing, then any code from a proper subshift of X to Y can be extended to an open bi-continuing code on X. These results are still valid when X is assumed to be only an almost specified shift, i.e., a subshift satisfying an irreducible version of the specification property.
Recommendations
- Open maps between shift spaces
- On semi-open codes and bi-continuing almost everywhere codes
- On the retracts and recodings of continuing codes
- Decompositions of factor codes and embeddings between shift spaces with unequal entropies
- Class-closing factor codes and constant-class-to-one factor codes from shifts of finite type
Cites work
- An Extension Theorem for Closing Maps of Shifts of Finite Type
- An Introduction to Symbolic Dynamics and Coding
- Chains, entropy, coding
- Constant-to-one and onto global maps of homomorphisms between strongly connected graphs
- Endomorphisms and automorphisms of the shift dynamical system
- Ergodic theory on compact spaces
- Infinite-to-One Codes and Markov Measures
- Lower entropy factors of sofic systems
- On the structure of a sofic shift space
- On the subsystems of topological Markov chains
- Open maps between shift spaces
- Putnam's resolving maps in dimension zero
- Sofic systems and encoding data
- Systèmes codés. (Coded systems)
- Weak equivalence for shifts of finite type
Cited in
(28)- On semi-open codes and bi-continuing almost everywhere codes
- Loss of Gibbs property in one-dimensional mixing shifts of finite type
- On the retracts and recodings of continuing codes
- On density of ergodic measures and generic points
- Topological and almost Borel universality for systems with the weak specification property
- Open maps between shift spaces
- Class-closing factor codes and constant-class-to-one factor codes from shifts of finite type
- Bi-resolving graph homomorphisms and extensions of bi-closing codes
- Dynamics and topology of \(S\)-gap shifts
- Decompositions of factor codes and embeddings between shift spaces with unequal entropies
- Synchronized components of a subshift
- Glider automata on all transitive sofic shifts
- Strong synchronized system
- Limit sets of stable cellular automata
- scientific article; zbMATH DE number 7645655 (Why is no real title available?)
- On -approachability, entropy density and -free shifts
- Suberesolving codes
- Schmidt's winning sets in S-gap shifts
- Totally synchronizing generated system
- On the completely irregular set of maps with the shadowing property
- A necessary and sufficient condition for the existence of invariant Gibbs measures
- Distributional chaos in shrinking target problems
- (S,w)-gap shifts and their entropy
- Set theory. Abstracts from the workshop held January 12--17, 2025
- On the weakness of the vague specification property
- Synchronized entropy of totally synchronizing generated systems
- Typical periodic optimization for dynamical systems: symbolic dynamics
- Derived shift space of coded systems and synchronized entropy of totally synchronizing generated systems
This page was built for publication: On the existence of open and bi-continuing codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3085130)
