Abstract
AbstractWe consider subshifts of the full shift of bi-infinite sequences with alphabet $\{ 0, 1, \ldots , n- 1\} $ defined by not allowing the sum of finite words to exceed a value depending on its length. These shifts we call bounded density shifts. We study these shifts in detail and make a comparison on the similarities to but also differences from the well-known $\beta $-shifts.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,General Mathematics
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献