Abstract
The notion of tree-shifts constitutes an intermediate class in between one-sided shift spaces and multidimensional ones. This paper proposes an algorithm for computing of the entropy of a tree-shift of finite type. Meanwhile, the entropy of a tree-shift of finite type is for some , where is a Perron number. This extends Lind's work on one-dimensional shifts of finite type. As an application, the entropy minimality problem is investigated, and we obtain the necessary and sufficient condition for a tree-shift of finite type being entropy minimal with some additional conditions.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.