Flow equivalence of subshifts of finite type

93Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

A complete set of computable invariants is given for deciding whether two irreducible subshifts of finite type have topologically equivalent suspension flows. © 1984, Cambridge University Press. All rights reserved.

Cite

CITATION STYLE

APA

Franks, J. (1984). Flow equivalence of subshifts of finite type. Ergodic Theory and Dynamical Systems, 4(1), 53–66. https://doi.org/10.1017/S0143385700002261

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free