On flow-equivalence of R-graph shifts
classification
🧮 math.DS
keywords
equivalenceflowmathcalpropertyshiftssubshiftsassociatedcertain
read the original 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.
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.