An effective criterion for prescribed block-code extensions
For a specified onto block self-map f of a nonempty two-sided irreducible sofic shift T, this note gives a complete finite computable criterion for extending that same map into T from a containing shift of finite type. It answers the specified-map question in Boyle's Problem 16.3, including its mixing case. For any tot...