Conjugacy of -subshifts and Textile Systems
Hiroshi Aso
Kyushu University, Fukuoka, Japan
Abstract
It will be shown that any topological conjugacy of -subshifts is factorized into a finite number of bipartite codes, and that in particular when textile shifts which are -subshifts arising from textile systems introduced by Nasu are taken each bipartite code appearing in this factorization is given by a bipartite graph code of textile shifts which is defined in terms of textile systems. The latter result extends the Williams result on strong shift equivalence of -topological Markov shifts to a -shift case.
Cite this article
Hiroshi Aso, Conjugacy of -subshifts and Textile Systems. Publ. Res. Inst. Math. Sci. 36 (2000), no. 1, pp. 1–18
DOI 10.2977/PRIMS/1195143225