Please use this identifier to cite or link to this item:

Title: Decidability of Irreducible tree shifts of finite type
Authors: 班榮超
Ban, Jung-Chao
Chang, Chih-Hung;Huang, Nai-Zhu;Wu, Yu-Liang
Contributors: 應數系
Keywords: Tree shift of finite type;Irreducible;  Complex prefix code;  Graph representation;  Strongly periodic point
Date: 2019-10
Issue Date: 2020-05-25 12:24:27 (UTC+8)
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.
Relation: Journal of Statistical Physics, p.1-20
Data Type: 期刊論文
Appears in Collections:[應用數學系] 期刊論文

Files in This Item:

File Description SizeFormat
13.pdf409KbAdobe PDF78View/Open

All items in 學術集成 are protected by copyright, with all rights reserved.

社群 sharing