Sofic systems and graphs

DOI10.1007/BF01319913zbMath0314.54043MaRDI QIDQ1220734

Roland Fischer

Publication date: 1975

Published in: Monatshefte für Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/177718

Mathematics Subject Classification ID

Related Items (45)

Constraints on the degree of a sofic homomorphism and the induced multiplication of measures on unstable sets ⋮ Systèmes codés. (Coded systems) ⋮ Traveling patterns in cellular automata ⋮ Sofic shifts with synchronizing presentations ⋮ On sofic systems. II ⋮ FACTOR MAPS OF LAMBDA-GRAPH SYSTEMS AND INCLUSIONS OF C*-ALGEBRAS ⋮ -ALGEBRAS ASSOCIATED WITH TWO-SIDED SUBSHIFTS ⋮ On simplicity of the \(C^\ast \)-algebras associated with \(\lambda \)-graph systems ⋮ Boundaries of disk-like self-affine tiles ⋮ Semi-groups and graphs for sofic systems ⋮ An invariant for bounded-to-one factor maps between transitive sofic subshifts ⋮ Pseudovarieties defining classes of sofic subshifts closed under taking shift equivalent subshifts. ⋮ Resolving extensions of finitely presented systems ⋮ A notion of synchronization of symbolic dynamics and a class of \(C ^{\ast }\)-algebras ⋮ A certain synchronizing property of subshifts and flow equivalence ⋮ On the sofic limit sets of cellular automata ⋮ Simple purely infinite \(C^\ast\)-algebras associated with normal subshifts ⋮ Path sets in one-sided symbolic dynamics ⋮ The size of power automata. ⋮ Markov diagrams for some non-Markovian systems ⋮ A new algebraic invariant for weak equivalence of sofic subshifts ⋮ Quadratic maps without asymptotic measure ⋮ Flow equivalence of sofic beta-shifts ⋮ REDUCED POWER AUTOMATA AND SOFIC SYSTEMS ⋮ Finitely generated bi\(\omega\)-languages ⋮ A class of simpleC^*-algebras arising from certain non-sofic subshifts ⋮ Sofic Constant-to-One Extensions of Subshifts of Finite Type ⋮ Reducibility of covers of AFT shifts ⋮ Determining presentations of sofic shifts ⋮ A Note on Minimal Covers for Sofic Systems ⋮ Lattice invariants for sofic shifts ⋮ Finite procedures for sofic systems ⋮ A categorical invariant of flow equivalence of shifts ⋮ Generic sequences, transducers and multiplication of normal numbers ⋮ Self-similar sets. III: Constructions with sofic systems ⋮ Subshifts, \(\lambda\)-graph bisystems and \(C^\ast\)-algebras ⋮ A conjugacy invariant for reducible sofic shifts and its semigroup characterizations ⋮ Minimal automaton for a factorial, transitive, and rational language ⋮ CONJUGACY INVARIANTS OF SUBSHIFTS: AN APPROACH FROM PROFINITE SEMIGROUP THEORY ⋮ On normality in shifts of finite type ⋮ Limit sets of stable cellular automata ⋮ On sofic systems. I ⋮ -ALGEBRAS ASSOCIATED WITH LAMBDA-SYNCHRONIZING SUBSHIFTS AND FLOW EQUIVALENCE ⋮ The dynamics of expansive invertible onesided cellular automata ⋮ Un codage sofique des automorphismes hyperboliques du tore

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sofic systems
• Subshifts of finite type and sofic systems
• On isomorphism of weak Bernoulli transformations
• Ergodic theory, entropy
• Bernoulli equilibrium states for axiom A diffeomorphisms
• Intrinsic Markov Chains
• Excessive functions of continuous time Markov chains
• Topological Entropy Bounds Measure-Theoretic Entropy
• Intrinsically ergodic systems

This page was built for publication: Sofic systems and graphs