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

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 E,D,C and O, 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 E D C O. 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…