On the entropy of Z^d subshifts of finite type

From MaRDI portal
Publication:676028





Using matrix representations of higher-dimensional subshifts of finite type, it is shown that the ``combinatorial entropy (the growth in the number of finite words) coincides with the topological entropy. Conditions are given under which the growth rate of periodic points coincides with the topological entropy. As is well known, this gives a convergent sequence of numbers, each readily computable, whose limit is the topological entropy and whose rate of convergence may be estimated. In a more restrictive setting, this has been used by \textit{N. G. Markley and M. E. Paul} [Proc. Lond. Math. Soc., III. Ser. 43, 251-272 (1981; Zbl 0479.54022); Lect. Notes Pure Appl. Math. 70, 135-157 (1981; Zbl 0475.58010)].




Cited in
(45)








This page was built for publication: On the entropy of \(\mathbb{Z}^d\) subshifts of finite type

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