No CrossRef data available.
Published online by Cambridge University Press: 05 July 2013
We 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.