Sofic systems and graphs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3442147 (Why is no real title available?)
- scientific article; zbMATH DE number 3227613 (Why is no real title available?)
- scientific article; zbMATH DE number 3062467 (Why is no real title available?)
- Bernoulli equilibrium states for axiom A diffeomorphisms
- Ergodic theory, entropy
- Excessive functions of continuous time Markov chains
- Intrinsic Markov Chains
- Intrinsically ergodic systems
- On isomorphism of weak Bernoulli transformations
- Sofic systems
- Subshifts of finite type and sofic systems
- Topological Entropy Bounds Measure-Theoretic Entropy
Cited in
(45)- Sofic shifts with synchronizing presentations
- FACTOR MAPS OF LAMBDA-GRAPH SYSTEMS AND INCLUSIONS OF C*-ALGEBRAS
- Boundaries of disk-like self-affine tiles
- On sofic systems. II
- Un codage sofique des automorphismes hyperboliques du tore
- Path sets in one-sided symbolic dynamics
- Limit sets of stable cellular automata
- The size of power automata.
- A class of simple \(C^{*}\)-algebras arising from certain non-sofic subshifts
- Determining presentations of sofic shifts
- A conjugacy invariant for reducible sofic shifts and its semigroup characterizations
- Quadratic maps without asymptotic measure
- Reducibility of covers of AFT shifts
- Simple purely infinite \(C^\ast\)-algebras associated with normal subshifts
- Pseudovarieties defining classes of sofic subshifts closed under taking shift equivalent subshifts.
- Generic sequences, transducers and multiplication of normal numbers
- Systèmes codés. (Coded systems)
- Sofic Constant-to-One Extensions of Subshifts of Finite Type
- \({C}^{\ast}\)-algebras associated with lambda-synchronizing subshifts and flow equivalence
- REDUCED POWER AUTOMATA AND SOFIC SYSTEMS
- Lattice invariants for sofic shifts
- On simplicity of the \(C^\ast \)-algebras associated with \(\lambda \)-graph systems
- A new algebraic invariant for weak equivalence of sofic subshifts
- An invariant for bounded-to-one factor maps between transitive sofic subshifts
- A Note on Minimal Covers for Sofic Systems
- Minimal automaton for a factorial, transitive, and rational language
- Markov diagrams for some non-Markovian systems
- On the sofic limit sets of cellular automata
- On normality in shifts of finite type
- Finitely generated bi\(\omega\)-languages
- Semi-groups and graphs for sofic systems
- Self-similar sets. III: Constructions with sofic systems
- Flow equivalence of sofic beta-shifts
- A notion of synchronization of symbolic dynamics and a class of \(C ^{\ast }\)-algebras
- Resolving extensions of finitely presented systems
- Traveling patterns in cellular automata
- A certain synchronizing property of subshifts and flow equivalence
- Subshifts, \(\lambda\)-graph bisystems and \(C^\ast\)-algebras
- \(C^*\)-algebras associated with two-sided subshifts
- A categorical invariant of flow equivalence of shifts
- Finite procedures for sofic systems
- CONJUGACY INVARIANTS OF SUBSHIFTS: AN APPROACH FROM PROFINITE SEMIGROUP THEORY
- The dynamics of expansive invertible onesided cellular automata
- On sofic systems. I
- Constraints on the degree of a sofic homomorphism and the induced multiplication of measures on unstable sets
This page was built for publication: Sofic systems and graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1220734)
