arXiv · 1910.13846
Decidability of irreducible tree shifts of finite type
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.
Explore related subjects
Keep this discovery
Jung-Chao Ban, Chih-Hung Chang, Nai-Zhu Huang, Yu-Liang Wu. 2019-10-30. Decidability of irreducible tree shifts of finite type. https://doi.org/10.1007/s10955-019-02407-z
Cite the original work for its findings. Save a collection to share your selection of sources.