scientific article; zbMATH DE number 177154
[For the entire collection see Zbl 0755.00019.] The authors generalise the idea of a transitive sofic system to what they call coded systems. A coded system is a subshift which is the closure of a uniformly continuous image of a countable irreducible Markov chain. Such a Markov chain together with the uniformly continuous map is called a cover. The authors then generalise many results for sofic systems to appropriate sub-classes of the coded systems -- the synchronised and half-synchronised systems. They define canonical Fischer covers for such systems and by using its characterisations develop an analogue of the sofic almost Markov theory. The paper not only develops the theory but is also a full exposition of the ideas.
- Systèmes codés. (Coded systems)
- Sofic shifts with synchronizing presentations
- Realtime subshifts
- Factor maps, entropy and fiber cardinality for Markov shifts
- Intrinsic ergodicity beyond specification: \({\beta}\)-shifts, \(S\)-gap shifts, and their factors
- Specification and towers in shift spaces
- Coded equivalence of one-sided topological Markov shifts
- Mixing coded systems
- On semi-open codes and bi-continuing almost everywhere codes
- Invariants for subshifts via nested sequences of shifts of finite type
- Markov diagrams for some non-Markovian systems
- scientific article; zbMATH DE number 4131691 (Why is no real title available?)
- Mixing properties in coded systems
- A Note on Minimal Covers for Sofic Systems
- Topological conjugacy for sofic systems
- A certain synchronizing property of subshifts and flow equivalence
- Covers of Non-Almost-Finite Type Sofic Systems
- scientific article; zbMATH DE number 177153 (Why is no real title available?)
- Dynamics and topology of \(S\)-gap shifts
- scientific article; zbMATH DE number 6914812 (Why is no real title available?)
- scientific article; zbMATH DE number 3999314 (Why is no real title available?)
- The automorphism group of a coded system
- Synchronized components of a subshift
- Glider automata on all transitive sofic shifts
- Strong synchronized system
- On entropy and intrinsic ergodicity of coded subshifts
- Multiplicities of covers for sofic shifts
- Compact factors of countable state Markov shifts.
- Direct prime subshifts and canonical covers
- Infinite minimal half synchronizing
- Geometric interpretation of the entropy of sofic systems
- On the Interplay of Direct Topological Factorizations and Cellular Automata Dynamics on Beta-Shifts
- Suberesolving codes
- Unambiguously coded shifts
- Totally synchronizing generated system
- Ergodic theory on coded shift spaces
- Bi-closing words
- Synchronized entropy of totally synchronizing generated systems
- Measures of maximal entropy of bounded density shifts
- Derived shift space of coded systems and synchronized entropy of totally synchronizing generated systems
- Tail invariant measures of the Dyck shift
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4037002)
