Topological entropy for shifts of finite type over \(\mathbb{Z}\) and trees
From MaRDI portal
Publication:2166753
DOI10.1016/j.tcs.2022.07.007WikidataQ113863131 ScholiaQ113863131MaRDI QIDQ2166753
Wen-Guei Hu, Chih-Hung Chang, Jung-Chao Ban, Yu-Liang Wu
Publication date: 25 August 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.13415
68Qxx: Theory of computing
Related Items
Cites Work
- Unnamed Item
- Sofic tree-shifts
- Cellular automata between sofic tree shifts
- Subsystem entropy for \(\mathbb {Z}^{d}\) sofic shifts
- A small aperiodic set of Wang tiles
- Tree shift topological entropy
- Mixing properties for hom-shifts and the distance between walks on associated graphs
- Tree-shifts of finite type
- Entropy on regular trees
- Characterization and topological behavior of homomorphism tree-shifts
- Undecidability and nonperiodicity for tilings of the plane
- Measure conjugacy invariants for actions of countable sofic groups
- Mixing properties of tree-shifts
- An Introduction to Symbolic Dynamics and Coding
- A BRIEF INTRODUCTION TO SOFIC ENTROPY THEORY
- Uniform Sampling of Subshifts of Finite Type on Grids and Trees
- Tree-shifts: Irreducibility, mixing, and the chaos of tree-shifts
- The undecidability of the domino problem