S-limited shifts

zbMATH Open1395.37010arXiv1708.08511MaRDI QIDQ1664074FDOQ1664074

Benjamin Matson, Elizabeth Sattler

Publication date: 24 August 2018

Published in: Real Analysis Exchange (Search for Journal in Brave)

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=S_1,ldots,S_p$, where $S_{i}subseteqmathbbN$ 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.

Full work available at URL: https://arxiv.org/abs/1708.08511

Recommendations

• Dynamics and topology of \(S\)-gap shifts
• Bounded density shifts
• Dynamics and entropy of \(\mathcal{S}\)-graph shifts
• Random subshifts of finite type
• Some notes on the classification of shift spaces: shifts of finite type; sofic shifts; and finitely defined shifts

zbMATH Keywords

entropyshift space\(S\)-gap shift

Mathematics Subject Classification ID

Symbolic dynamics (37B10)

Cited In (4)

• Dynamics and entropy of \(\mathcal{S}\)-graph shifts
• Beyond Bowen’s Specification Property
• Computability of topological pressure on compact shift spaces beyond finite type*
• Ergodic theory on coded shift spaces

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)