Semi-groups and graphs for sofic systems (Q1112372): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological entropy and equivalence of dynamical systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Minimal Covers for Sofic Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Endomorphisms of irreducible subshifts of finite type / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sofic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite procedures for sofic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sofic systems and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4185477 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3254327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Endomorphisms and automorphisms of the shift dynamical system / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sofic systems. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sofic systems and encoding data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transmission rates and factors of Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: An invariant for bounded-to-one factor maps between transitive sofic subshifts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intrinsic Markov Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3947868 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subshifts of finite type and sofic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of subshifts of finite type / rank
 
Normal rank

Latest revision as of 11:08, 19 June 2024

scientific article
Language Label Description Also known as
English
Semi-groups and graphs for sofic systems
scientific article

    Statements

    Semi-groups and graphs for sofic systems (English)
    0 references
    0 references
    0 references
    0 references
    1986
    0 references
    A sofic system is a symbolic system which is the image of a shift of finite type under a continuous shift-commuting map. Sofic systems can also be defined using finite semigroups, or using edge-labelled directed graphs. The authors prove a number of theorems relating the dynamics of a sofic system, the algebraic properties of the defining semigroup, and the properties of the defining graph. These results, for the most part, are concerned with covers (pairs \((\Sigma_ A,\phi)\), where \(\Sigma_ A\) is a shift of finite type and \(\phi\) is a continuous shift-commuting map from \(\Sigma_ A\) onto the sofic system), in particular with the degree of a cover (the unique integer k such that \(\phi\) is k-to-one almost everywhere), and with two important technical conditions, called resolving and minimality, on covers.
    0 references
    0 references
    0 references
    0 references
    0 references
    defining semi-group
    0 references
    matrix (or graph) theoretic properties
    0 references
    right and left transition matrices
    0 references
    sofic graphs
    0 references
    finite-to-one covers
    0 references
    minimal left and right resolving covers
    0 references
    sofic system
    0 references
    image of a shift of finite type
    0 references
    continuous shift-commuting map
    0 references
    edge-labelled directed graphs
    0 references