pith. sign in

arxiv: 0911.5475 · v1 · submitted 2009-11-29 · 🧮 math.DS · math.CO

The chain relation in sofic subshifts

classification 🧮 math.DS math.CO
keywords soficsubshiftchainrelationsubshiftsapproxattractorschain-mixing
0
0 comments X
read the original 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/_\approx$ that offers insight into some properties of the original subshift. Using $G/_\approx$ 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.