Skip to main content Accessibility help
×
Home
Hostname: page-component-559fc8cf4f-q7jt5 Total loading time: 0.274 Render date: 2021-03-07T09:00:24.715Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": false, "newCiteModal": false, "newCitedByModal": true }

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: kengo@yokohama-cu.ac.jp)

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.

Full text views

Full text views reflects PDF downloads, PDFs sent to Google Drive, Dropbox and Kindle and HTML full text views.

Total number of HTML views: 0
Total number of PDF views: 9 *
View data table for this chart

* Views captured on Cambridge Core between September 2016 - 7th March 2021. This data will be updated every 24 hours.

Send article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

On strong shift equivalence of symbolic matrix systems
Available formats
×

Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

On strong shift equivalence of symbolic matrix systems
Available formats
×

Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

On strong shift equivalence of symbolic matrix systems
Available formats
×
×

Reply to: Submit a response


Your details


Conflicting interests

Do you have any conflicting interests? *