S-limited shifts

From MaRDI portal
Publication:1664074




Abstract: In this paper, we explore the construction and dynamical properties of mathcalS-limited shifts. An S-limited shift is a subshift defined on a finite alphabet mathcalA=1,ldots,p by a set mathcalS=S1,ldots,Sp, where SisubseteqmathbbN describes the allowable lengths of blocks in which the corresponding letter may appear. We give conditions for which an mathcalS-limited shift is a subshift of finite type or sofic. We give an exact formula for finding the entropy of such a shift and show that an mathcalS-limited shift and its factors must be intrinsically ergodic. Finally, we give some conditions for which two such shifts can be conjugate, and additional information about conjugate mathcalS-limited shifts.









This page was built for publication: S-limited shifts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1664074)