Flow equivalence of sofic shifts
We say that two shifts are flow equivalent if there exists a homeomorphism between their mapping tori which preserves the orbits and their orientation. The authors classify certain sofic shifts up to flow equivalence, using invariants of the canonical Fisher cover. Let \(X\) and \(X'\) be irreducible subshifts of finite type which are flow equivalent. If \(Y\) and \(Y'\) are proper subsystems of \(X\) and \(X'\) respectively, which are flow equivalent through \(\varphi: SY \rightarrow SY'\), then it is proved that there exists a flow equivalence \(\tilde{\varphi} : SX \rightarrow SX'\) such that \(\varphi = \tilde{\varphi}|_{SY}\). By using this result, they prove a reduction theorem, which is used to classify the near Markov shifts up to flow equivalence. Moreover, the authors provide a classification of point extension type sofic shifts up to flow equivalence. Finally, they propose procedures to determine whether a sofic shift is of point extension type.
- \({C}^{\ast}\)-algebras associated with lambda-synchronizing subshifts and flow equivalence
- A categorical invariant of flow equivalence of shifts
- A class of C*-algebras and topological Markov chains
- A complete invariant for the topology of one-dimensional substitution tiling spaces
- A Note on Minimal Covers for Sofic Systems
- A topological invariant of flows on 1-dimensional spaces
- An algorithm for sofic shift equivalence
- An Introduction to Symbolic Dynamics and Coding
- Automorphisms and subsystems of the shift.
- Automorphisms of the Dimension Group and Gyration Numbers
- Bowen-Franks groups as an invariant for flow equivalence of subshifts
- Classification of Cuntz-Krieger algebras
- Classification of Cuntz-Krieger algebras up to stable isomorphism
- Constant-to-one and onto global maps of homomorphisms between strongly connected graphs
- Counting the relatively finite factors of a Bernoulli shift
- Covers of Non-Almost-Finite Type Sofic Systems
- Equivariant flow equivalence for shifts of finite type, by matrix equivalence over group rings
- Finite group extensions of shifts of finite type: K-theory, Parry and Livšic
- Flow equivalence and isotopy for subshifts
- Flow equivalence of reducible shifts of finite type
- Flow equivalence of shifts of finite type via positive factorizations.
- Flow equivalence of sofic beta-shifts
- Flow equivalence of subshifts of finite type
- Homology for zero-dimensional nonwandering sets
- scientific article; zbMATH DE number 3146217 (Why is no real title available?)
- scientific article; zbMATH DE number 3870197 (Why is no real title available?)
- scientific article; zbMATH DE number 3979437 (Why is no real title available?)
- scientific article; zbMATH DE number 4060291 (Why is no real title available?)
- scientific article; zbMATH DE number 4080184 (Why is no real title available?)
- scientific article; zbMATH DE number 4085971 (Why is no real title available?)
- scientific article; zbMATH DE number 4085972 (Why is no real title available?)
- scientific article; zbMATH DE number 4115516 (Why is no real title available?)
- scientific article; zbMATH DE number 776267 (Why is no real title available?)
- Lower entropy factors of sofic systems
- On flow equivalence of one-sided topological Markov shifts
- On flow-equivalence of \({\mathcal R}\)-graph shifts
- On sofic systems. I
- On the structure of covers of sofic shifts
- Open maps between shift spaces
- Poset block equivalence of integral matrices
- Recent results on syntactic groups of prefix codes.
- Reducibility of covers of AFT shifts
- Sofic systems and encoding data
- Symbolic dynamics. One-sided, two-sided and countable state Markov shifts
- The Automorphism Group of a Shift of Finite Type
- The spectra of nonnegative matrices via symbolic dynamics
- The mapping class group of a shift of finite type
- Reducibility of covers of AFT shifts
- A hierarchy of shift equivalent sofic shifts
- A categorical invariant of flow equivalence of shifts
- Flow equivalence of sofic beta-shifts
- Finite group extensions of shifts of finite type: K-theory, Parry and Livšic
- The topologies of sofic subshifts have computable Pierce invariants
- scientific article; zbMATH DE number 4060291 (Why is no real title available?)
- scientific article; zbMATH DE number 4085971 (Why is no real title available?)
- An algorithm for sofic shift equivalence
- Sofic Constant-to-One Extensions of Subshifts of Finite Type
- Flow equivalence and isotopy for subshifts
- Flow equivalence of reducible shifts of finite type and Cuntz-Krieger algebras.
- Flow equivalence of G-SFTs
- Equivariant flow equivalence for shifts of finite type, by matrix equivalence over group rings
- On the structure of covers of sofic shifts
- THE SYNTACTIC GRAPH OF A SOFIC SHIFT IS INVARIANT UNDER SHIFT EQUIVALENCE
- Flow equivalence of shifts of finite type via positive factorizations.
This page was built for publication: Flow equivalence of sofic shifts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1650032)