| dc.contributor | 應數系 | - |
| dc.creator (作者) | 班榮超 | - |
| dc.creator (作者) | Ban, Jung-Chao | - |
| dc.creator (作者) | Chang, Chih-Hung;Huang, Nai-Zhu;Wu, Yu-Liang | - |
| dc.date (日期) | 2019-10 | - |
| dc.date.accessioned | 25-May-2020 12:24:27 (UTC+8) | - |
| dc.date.available | 25-May-2020 12:24:27 (UTC+8) | - |
| dc.date.issued (上傳時間) | 25-May-2020 12:24:27 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/129754 | - |
| dc.description.abstract (摘要) | 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. | - |
| dc.format.extent | 419177 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.relation (關聯) | Journal of Statistical Physics, p.1-20 | - |
| dc.subject (關鍵詞) | Tree shift of finite type ; Irreducible ; Complex prefix code ; Graph representation ; Strongly periodic point | - |
| dc.title (題名) | Decidability of Irreducible tree shifts of finite type | - |
| dc.type (資料類型) | 期刊論文 | - |
