No CrossRef data available.
Article contents
Entropy bounds for multi-word perturbations of subshifts
Published online by Cambridge University Press: 27 March 2023
Abstract
Given a subshift $\Sigma $ of finite type and a finite set S of finite words, let $\Sigma \langle S\rangle $ denote the subshift of $\Sigma $ that avoids S. We establish a general criterion under which we can bound the entropy perturbation $h(\Sigma ) - h(\Sigma \langle S\rangle )$ from above. As an application, we prove that this entropy difference tends to zero with a sequence of such sets $S_1, S_2,\ldots $ under various assumptions on the $S_i$.
MSC classification
- Type
- Original Article
- Information
- Copyright
- © The Author(s), 2023. Published by Cambridge University Press