On the existence of open and bi-continuing codes

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.

20 pages, 3 figures. v2: minor revision. typos corrected. Final version to appear in Transactions AMS

References in corpus (1)

• Open maps between shift spaces

Cited by in corpus (5)

• Large deviations of return times and related entropy estimators on shift spaces
• Limit sets of stable Cellular Automata
• Typical periodic optimization for dynamical systems: symbolic dynamics
• Decompositions of factor codes and embeddings between shift spaces with unequal entropies
• Bi-resolving graph homomorphisms and extensions of bi-closing codes