Decidability of Irreducible Tree Shifts of Finite Type

doi:10.1007/s10955-019-02407-z

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	Ban, Jung-Chao	en_US
dc.contributor.author	Chang, Chih-Hung	en_US
dc.contributor.author	Huang, Nai-Zhu	en_US
dc.contributor.author	Wu, Yu-Liang	en_US
dc.date.accessioned	2019-12-13T01:12:19Z	-
dc.date.available	2019-12-13T01:12:19Z	-
dc.date.issued	1970-01-01	en_US
dc.identifier.issn	0022-4715	en_US
dc.identifier.uri	http://dx.doi.org/10.1007/s10955-019-02407-z	en_US
dc.identifier.uri	http://hdl.handle.net/11536/153175	-
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.	en_US
dc.language.iso	en_US	en_US
dc.subject	Tree shift of finite type	en_US
dc.subject	Irreducible	en_US
dc.subject	Complex prefix code	en_US
dc.subject	Graph representation	en_US
dc.subject	Strongly periodic point	en_US
dc.title	Decidability of Irreducible Tree Shifts of Finite Type	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1007/s10955-019-02407-z	en_US
dc.identifier.journal	JOURNAL OF STATISTICAL PHYSICS	en_US
dc.citation.spage	0	en_US
dc.citation.epage	0	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	電機工程學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.contributor.department	Department of Electrical and Computer Engineering	en_US
dc.identifier.wosnumber	WOS:000492324000001	en_US
dc.citation.woscount	0	en_US
顯示於類別：	期刊論文