On the topological entropy of subshifts of finite type on free semigroups

From MaRDI portal
Publication:2233628



Abstract: In this paper, we provide an effective method to compute the topological entropies of G-subshifts of finite type (G-SFTs) with G=Fd and Sd, the free group and free semigroup with d generators respectively. We develop the entropy formula by analyzing the corresponding systems of nonlinear recursive equations (SNREs). Four types of SNREs of S2-SFTs, namely the types mathbfE,mathbfD,mathbfC and mathbfO, are introduced and we could compute their entropies explicitly. This enables us to give the complete characterization of S2-SFTs on two symbols. That is, the set of entropies of S2-SFTs on two symbols is equal to mathbfEcupmathbfDcupmathbfCcupmathbfO. The methods developed in Sd-SFTs will also be applied to the study of the entropy theory of Fd-SFTs. The entropy formulae of Sd-, Fd-golden mean shifts and k-colored chessboards are also presented herein.











This page was built for publication: On the topological entropy of subshifts of finite type on free semigroups

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