An aim of this article is to highlight dynamical differences between the greedy, and hence the lazy, -shift (transformation) and an intermediate -shift (transformation), for a fixed . Specifically, a classification in terms of the kneading invariants of the linear maps for which the corresponding intermediate -shift is of finite type is given. This characterisation is then employed to construct a class of pairs such that the intermediate -shift associated with is a subshift of finite type. It is also proved that these maps are not transitive. This is in contrast to the situation for the corresponding greedy and lazy -shifts and -transformations, for which both of the two properties do not hold.

生成讲解博客的中文版本

生成AI智能校验的中文版本