Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/129754| 題名: | Decidability of Irreducible tree shifts of finite type | 作者: | 班榮超 Ban, Jung-Chao Chang, Chih-Hung;Huang, Nai-Zhu;Wu, Yu-Liang |
貢獻者: | 應數系 | 關鍵詞: | Tree shift of finite type ; Irreducible ; Complex prefix code ; Graph representation ; Strongly periodic point | 日期: | Oct-2019 | 上傳時間: | 25-May-2020 | 摘要: | We reveal an algorithm for determining the complete prefix code irreducibility (CPC-irreducibility) of dyadic trees labeled by a finite alphabet. By introducing an extended directed graph representation of tree shift of finite type (TSFT), we show that the CPC-irreducibility of TSFTs is related to the connectivity of its graph representation, which is a similar result to one-dimensional shifts of finite type. | 關聯: | Journal of Statistical Physics, p.1-20 | 資料類型: | 期刊論文 |
| Appears in Collections: | 期刊論文 |
Show full item record
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.