English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Classification is a central problem for dynamical systems, in particular forfamilies that arise in a wide range of topics, like substitution subshifts. Itis important to be able to distinguish whether two such subshifts areisomorphic, but the existing invariants are not sufficient for this purpose. Wefirst show that given two minimal substitution subshifts, there exists acomputable constant $R$ such that any factor map between these subshifts (ifany) is the composition of a factor map with a radius smaller than $R$ and somepower of the shift map. Then we prove that it is decidable to check whether agiven sliding block code is a factor map between two prescribed minimalsubstitution subshifts. As a consequence of these two results, we provide analgorithm that, given two minimal substitution subshifts, decides whether oneis a factor of the other and, as a straightforward corollary, whether they areisomorphic.

Decidability of the isomorphism and the factorization between minimal substitution subshifts