Flow equivalence of subshifts of finite type

1984 ◽  
Vol 4 (1) ◽  
pp. 53-66 ◽  
Author(s):  
John Franks
Keyword(s):  
Finite Type ◽  
Suspension Flows ◽  
Flow Equivalence ◽  
Complete Set ◽  
Subshifts Of Finite Type

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

A stochastic analogue of a theorem of Boyle's on almost flow equivalence

1993 ◽  
Vol 13 (3) ◽  
pp. 417-444 ◽  
Author(s):  
Paulo Ventura Araújo
Keyword(s):  
Finite Type ◽  
Topological Classification ◽  
Suspension Flows ◽  
Axiom A ◽  
Stochastic Version ◽  
Flow Equivalence ◽  
Subshifts Of Finite Type ◽  
Basic Sets

AbstractWe study a new topological classification of suspension flows on subshifts of finite type, and obtain a new proof of a theorem of Boyle's which states that, in an appropriate sense, all such flows are alike. We prove that the stochastic version of this classification is non-trivial by exhibiting a certain invariant, and show that this invariant is complete in a particular case, although not in general. Symbolic flows are important as models of basic sets of Axiom A flows, and so we discuss the significance of our results for this latter type of flow.

Subshifts of finite type

1976 ◽  
pp. 117-130
Author(s):  
Manfred Denker ◽  
Christian Grillenberger ◽  
Karl Sigmund
Keyword(s):  
Finite Type ◽  
Subshifts Of Finite Type

Endomorphisms of irreducible subshifts of finite type

1974 ◽  
Vol 8 (2) ◽  
pp. 167-175 ◽  
Author(s):  
Ethan M. Coven ◽  
Michael E. Paul
Keyword(s):  
Finite Type ◽  
Subshifts Of Finite Type

Chaos for Subshifts of Finite Type

2005 ◽  
Vol 21 (6) ◽  
pp. 1407-1414 ◽  
Author(s):  
Huo Yun Wang ◽  
Jin Cheng Xiong
Keyword(s):  
Finite Type ◽  
Subshifts Of Finite Type
Sign in / Sign up

Export Citation Format

Share Document