The chain relation in sofic subshifts

zbMATH Open1151.37014arXiv0911.5475MaRDI QIDQ3536084FDOQ3536084

Authors: Alexandr Kazda 

Publication date: 17 November 2008

Abstract: The paper gives a characterisation of the chain relation of a sofic subshift. Every sofic subshift $Sigma$ can be described by a labelled graph $G$. Factorising $G$ in a suitable way we obtain the graph $G{/}_{a}pprox$ that offers insight into some properties of the original subshift. Using $G{/}_{a}pprox$ we describe first the chain relation in $Sigma$, then characterise chain-transitive sofic subshifts, chain-mixing sofic subshifts and finally the attractors of the subshift dynamic system. At the end we present (straightforward) algorithms deciding chain-transitivity and chain-mixing properties of a sofic subshift and listing all the attractors of the subshift system.

Full work available at URL: https://arxiv.org/abs/0911.5475

Recommendations

• Semi-groups and graphs for sofic systems
• scientific article; zbMATH DE number 1421012
• On sofic systems. I
• scientific article; zbMATH DE number 4060291
• Determining presentations of sofic shifts

zbMATH Keywords

attractorchain-transitivitysofic subshiftchain relationchain-mixing

Mathematics Subject Classification ID

Dynamical systems involving transformations and group actions with special properties (minimality, distality, proximality, expansivity, etc.) (37B05) Symbolic dynamics (37B10) Stability of topological dynamical systems (37B25)

Cited In (5)

• Algorithmic approach to Devaney chaos in shift spaces
• Title not available (Why is that?)
• Arithmetical complexity of the language of generic limit sets of cellular automata
• Title not available (Why is that?)
• Sofic subshifts and piecewise isometric systems

This page was built for publication: The chain relation in sofic subshifts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3536084)