Weak equivalence for shifts of finite type

DOI10.1016/S0019-3577(07)80058-9zbMath1143.37011MaRDI QIDQ935924

Joseph Barth, Andrew Dykstra

Publication date: 12 August 2008

Published in: Indagationes Mathematicae. New Series (Search for Journal in Brave)

zbMATH Keywords

weak equivalence; shift of finite type; phase matrix

Mathematics Subject Classification ID

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

37B10: Symbolic dynamics

37A20: Algebraic ergodic theory, cocycles, orbit equivalence, ergodic equivalence relations

Related Items

Limit sets of stable cellular automata, Category theory of symbolic dynamics, On the existence of open and bi-continuing codes

Cites Work

• A weak equivalence between shifts of finite type
• Morphisms from non-periodic $\mathbb{Z}^2$ subshifts II: constructing homomorphisms to square-filling mixing shifts of finite type
• Lower entropy factors of sofic systems
• Infinite-to-One Codes and Markov Measures
• Surjective Extensions of Sliding-Block Codes
• Morphisms from non-periodic \mathbb{Z}^{2} subshifts I: constructing embeddings from homomorphisms
• Characterization of inert actions on periodic points. Part I
• Characterization of inert actions on periodic points. Part II
• The action of inert finite-order automorphisms on finite subsystems of the shift
• On the sofic limit sets of cellular automata
• An Introduction to Symbolic Dynamics and Coding
• Unnamed Item