Decidability of Irreducible Tree Shifts of Finite Type
Sign Up to like & getrecommendations! Published in 2019 at "Journal of Statistical Physics"
DOI: 10.1007/s10955-019-02407-z
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… read more here.
Keywords: finite type; irreducible tree; shifts finite; decidability irreducible ... See more keywords