標題: Decidability of Irreducible Tree Shifts of Finite Type
作者: Ban, Jung-Chao
Chang, Chih-Hung
Huang, Nai-Zhu
Wu, Yu-Liang
應用數學系
電機工程學系
Department of Applied Mathematics
Department of Electrical and Computer Engineering
關鍵字: Tree shift of finite type;Irreducible;Complex prefix code;Graph representation;Strongly periodic point
公開日期: 1-一月-1970
摘要: 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.
URI: http://dx.doi.org/10.1007/s10955-019-02407-z
http://hdl.handle.net/11536/153175
ISSN: 0022-4715
DOI: 10.1007/s10955-019-02407-z
期刊: JOURNAL OF STATISTICAL PHYSICS
起始頁: 0
結束頁: 0
顯示於類別:期刊論文