| dc.contributor | 應數系 | |
| dc.creator (作者) | 班榮超 | |
| dc.creator (作者) | Ban, Jung-Chao | |
| dc.creator (作者) | Chang, Chih-Hung;Hu, Wen-Guei;Wu, Yu-Liang | |
| dc.date (日期) | 2022-09 | |
| dc.date.accessioned | 6-Feb-2023 14:12:39 (UTC+8) | - |
| dc.date.available | 6-Feb-2023 14:12:39 (UTC+8) | - |
| dc.date.issued (上傳時間) | 6-Feb-2023 14:12:39 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/143279 | - |
| dc.description.abstract (摘要) | We study the topological entropy of hom tree-shifts and show that, although the topological entropy is not a conjugacy invariant for tree-shifts in general, it remains invariant for hom tree higher block shifts. In [16], [17], Petersen and Salama demonstrated the existence of topological entropy for tree-shifts and , where is the hom tree-shift derived from X. We characterize a necessary and sufficient condition when the equality holds for the case where X is a shift of finite type. Additionally, two novel phenomena have been revealed for tree-shifts. There is a gap in the set of topological entropy of hom tree-shifts of finite type, making such a set not dense. Last but not least, the topological entropy of a reducible hom tree-shift of finite type can be strictly larger than that of its maximal irreducible component. | |
| dc.format.extent | 105 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | Theoretical Computer Science, Vol.930, pp.24-32 | |
| dc.subject (關鍵詞) | Tree-SFT; Topological entropy | |
| dc.title (題名) | Topological entropy for shifts of finite type over Z and trees | |
| dc.type (資料類型) | article | |
| dc.identifier.doi (DOI) | 10.1016/j.tcs.2022.07.007 | |
| dc.doi.uri (DOI) | https://doi.org/10.1016/j.tcs.2022.07.007 | |
