Weak equivalence for shifts of finite type
From MaRDI portal
Publication:935924
DOI10.1016/S0019-3577(07)80058-9zbMath1143.37011MaRDI QIDQ935924
Publication date: 12 August 2008
Published in: Indagationes Mathematicae. New Series (Search for Journal in Brave)
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Symbolic dynamics (37B10) Algebraic ergodic theory, cocycles, orbit equivalence, ergodic equivalence relations (37A20)
Related Items
Category theory of symbolic dynamics ⋮ On the existence of open and bi-continuing codes ⋮ Limit sets of stable cellular automata
Cites Work
- Unnamed Item
- 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