Topological entropy of a class of subshifts of finite type
The entropy of a higher-dimensional shift of finite type is known to be uncomputable in general, in the sense that an entropy-calculating algorithm could be used as a component of an algorithm which would solve the halting problem for Turing machines, by work of \textit{L. P. Hurd} et al. [Ergodic Theory Dyn. Syst. 12, No. 2, 255--265 (1992; Zbl 0770.58017)]. Here a special class of shifts of finite type are described for which the topological entropy can be estimated, and the asymptotic value (the class is parameterized) is computed explicitly.
scientific article; zbMATH DE number 6996492