On flow-equivalence of R-graph shifts

2014/06/24 by Krieger, Wolfgang
#Dynamical Systems (math.DS) #FOS: Mathematics

paper · doi:10.48550/arxiv.1406.6283

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 \mathcal R-graphs that their isomorphism is implied by the flow equivalence of their \mathcal R-graph shifts.

Related

• A Construction of Subshifts and a Class of Semigroups
• A certain synchronizing property of subshifts and flow equivalence
• Shift equivalence implies flow equivalence for shifts of finite type
• Flow Equivalence of Shift Spaces
• On Lambda-Graph Systems for Subshifts of Subshifts