On flow-equivalence of R-graph shifts

DOI10.17879/65219672957MaRDI QIDQ2956301zbMATH OpenFDO

Authors Wolfgang Krieger

Publication date 16 January 2017

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

zbMATH Keywords

\({\mathcal R}\)-graphsflow equivalencesubshifts

Mathematics Subject Classification ID

Symbolic dynamics (37B10) Topological and differentiable equivalence, conjugacy, moduli, classification of dynamical systems (37C15)

Abstract: We show that Property $(A)$ of subshifts and the semigroup, that is associated to subshifts with Property (A), are invariants of flow equivalence. We show for certain $mathcalR$-graphs that their isomorphism is implied by the flow equivalence of their $mathcalR$-graph shifts.

Recommendations

• A construction of subshifts and a class of semigroups
• On subshift presentations
• A categorical invariant of flow equivalence of shifts
• A certain synchronizing property of subshifts and flow equivalence
• Flow equivalence of shifts of finite type via positive factorizations.

Cited in

(6)

• Markov-Dyck shifts, neutral periodic points and topological conjugacy
• Flow equivalence of sofic shifts
• On subshift presentations
• A construction of subshifts and a class of semigroups
• Encodings of trajectories and invariant measures
• THE SYNTACTIC GRAPH OF A SOFIC SHIFT IS INVARIANT UNDER SHIFT EQUIVALENCE

This page was built for publication: On flow-equivalence of \({\mathcal R}\)-graph shifts

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