On flow-equivalence of R-graph shifts
Dynamical Systems
2014-07-22 v2
Abstract
We show that Property of subshifts and the semigroup, that is associated to subshifts with Property (A), are invariants of flow equivalence. We show for certain -graphs that their isomorphism is implied by the flow equivalence of their -graph shifts.
Cite
@article{arxiv.1406.6283,
title = {On flow-equivalence of R-graph shifts},
author = {Wolfgang Krieger},
journal= {arXiv preprint arXiv:1406.6283},
year = {2014}
}
Comments
9 pages