IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-0-8176-4789-6_6.html

Application of Infinite Labeled Graphs to Symbolic Dynamical Systems

In: Structural Analysis of Complex Networks

Author

Listed:
  • Kengo Matsumoto

    (Joetsu University of Education, Department of Mathematics)

Abstract

We apply a theory of infinite labeled graphs to studying presentations and classifications of symbolic dynamical systems, by introducing a class of infinite labeled graphs, called λ-graph systems. Its matrix presentation is called a symbolic matrix system. The notions of a λ-graph system and symbolic matrix system are generalized notions of a finite labeled graph and symbolic matrix for sofic subshifts to general subshifts. Strong shift equivalence and shift equivalence between symbolic matrix systems are formulated so that two subshifts are topologically conjugate if and only if the associated canonical symbolic matrix systems are strong shift equivalent. We construct several kinds of shift equivalence invariants for symbolic matrix systems. They are the dimension groups, the K-groups, and the Bowen–Franks groups that are generalizations of the corresponding notions for nonnegative matrices. They yield topological conjugacy invariants of subshifts. The entropic quantities called λ-entropy and volume entropy for λ-graph systems are also studied related to the topological entropy of symbolic dynamics.

Suggested Citation

  • Kengo Matsumoto, 2011. "Application of Infinite Labeled Graphs to Symbolic Dynamical Systems," Springer Books, in: Matthias Dehmer (ed.), Structural Analysis of Complex Networks, chapter 0, pages 137-168, Springer.
    • Handle: RePEc:spr:sprchp:978-0-8176-4789-6_6
    DOI: 10.1007/978-0-8176-4789-6_6
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-0-8176-4789-6_6. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.