| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6875387 | Theoretical Computer Science | 2018 | 8 Pages |
Abstract
We give a definition of topological entropy for tree shifts, prove that the limit in the definition exists, and show that it dominates the topological entropy of the associated one-dimensional shift of finite type when the labeling of the tree shares the same restrictions.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Karl Petersen, Ibrahim Salama,