paper

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

arXiv:1803.03082

Abstract

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