Hostname: page-component-78c5997874-fbnjt Total loading time: 0 Render date: 2024-11-17T19:10:33.374Z Has data issue: false hasContentIssue false

On strong shift equivalence of symbolic matrix systems

Published online by Cambridge University Press:  23 September 2003

KENGO MATSUMOTO
Affiliation:
Department of Mathematical Sciences, Yokohama City University, Seto 22-2, Kanazawa-ku, Yokohama 236-0027, Japan (e-mail: [email protected])

Abstract

A symbolic matrix system and a $\lambda$-graph system for a subshift are generalizations of a symbolic matrix and a $\lambda$-graph (= finite symbolic matrix); for a sofic shift respectively. In [K. Matsumoto. (Presentations of subshifts and their topological conjugacy invariants. Doc. Math. 4 (1999), 285–340)], two equivalence relations between symbolic matrix systems were formulated, properly strong shift equivalence and strong shift equivalence, which are related to topological conjugacy of subshifts. In this paper, we first prove that these two equivalence relations are equivalent to each other for a large class of symbolic matrix systems. State splitting of a $\lambda$-graph system is introduced as a generalization of state splitting of a finite directed graph. State splitting gives rise to a strong shift equivalence for the corresponding symbolic matrix systems. We prove that two subshifts are topologically conjugate if and only if the canonical $\lambda$-graph system for one subshift is obtained by a finite sequence of merged state splittings and merged state amalgamations from the canonical $\lambda$-graph system for the other subshift.

Type
Research Article
Copyright
2003 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)