Flow equivalence of Subshifts of Finite Type

John Franks

doi:10.1017/S0143385700002261

Flow equivalence of Subshifts of Finite Type

John Franks

Mathematics

Research output: Contribution to journal › Article › peer-review

84 Scopus citations

Abstract

A complete set of computable invariants is given for deciding whether two irreducible subshifts of finite type have topologically equivalent suspension flows.

Original language	English
Pages (from-to)	53
Journal	Ergodic Theory and Dynamical Systems
Volume	4
DOIs	https://doi.org/10.1017/S0143385700002261
State	Published - 1984

Access to Document

10.1017/S0143385700002261

Cite this

@article{6b5460caa7fa49969664dd47f4e85a2d,

title = "Flow equivalence of Subshifts of Finite Type",

abstract = "A complete set of computable invariants is given for deciding whether two irreducible subshifts of finite type have topologically equivalent suspension flows.",

author = "John Franks",

year = "1984",

doi = "10.1017/S0143385700002261",

language = "English",

volume = "4",

pages = "53",

journal = "Ergodic Theory and Dynamical Systems",

issn = "0143-3857",

publisher = "Cambridge University Press",

}

TY - JOUR

T1 - Flow equivalence of Subshifts of Finite Type

AU - Franks, John

PY - 1984

Y1 - 1984

N2 - A complete set of computable invariants is given for deciding whether two irreducible subshifts of finite type have topologically equivalent suspension flows.

AB - A complete set of computable invariants is given for deciding whether two irreducible subshifts of finite type have topologically equivalent suspension flows.

U2 - 10.1017/S0143385700002261

DO - 10.1017/S0143385700002261

M3 - Article

SN - 0143-3857

VL - 4

SP - 53

JO - Ergodic Theory and Dynamical Systems

JF - Ergodic Theory and Dynamical Systems

ER -

Flow equivalence of Subshifts of Finite Type

Abstract

Access to Document

Fingerprint

Cite this