Flow equivalence of subshifts of finite type
暂无分享,去创建一个
A complete set of computable invariants is given for deciding whether two irreducible subshifts of finite type have topologically equivalent suspension flows.
[1] John Franks,et al. Homology for zero-dimensional nonwandering sets , 1977 .
[2] John Franks,et al. Homology and Dynamical Systems , 1982 .
[3] R. F. Williams. Classification of subshifts of finite type , 1973 .
[4] Dennis Sullivan,et al. A topological invariant of flows on 1-dimensional spaces , 1975 .