Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/129754| DC Field | Value | Language |
|---|---|---|
| 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 | 2020-05-25T04:24:27Z | - |
| dc.date.available | 2020-05-25T04:24:27Z | - |
| dc.date.issued | 2020-05-25T04:24:27Z | - |
| dc.identifier.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 | 期刊論文 | - |
| item.fulltext | With Fulltext | - |
| item.cerifentitytype | Publications | - |
| item.openairetype | 期刊論文 | - |
| item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
| item.grantfulltext | restricted | - |
| Appears in Collections: | 期刊論文 | |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.