Skip to main content
SpringerLink
Log in

Application of Infinite Labeled Graphs to Symbolic Dynamical Systems

  • Chapter
  • First Online:
Structural Analysis of Complex Networks

  • 2815 Accesses

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.

MSC2000: Primary 37B10; Secondary 28D20, 46L80

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 149.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 199.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bates T, Pask D (2007) C ∗-algebras of labelled graphs. J Oper Theory 57:207–226

    MATH  MathSciNet  Google Scholar 

  2. Blanchard F, Hansel G (1986) Systems codés. Theor Comput Sci 44:17–49

    Article  MATH  MathSciNet  Google Scholar 

  3. Bowen R, Franks J (1977) Homology for zero-dimensional nonwandering sets. Ann Math 106:73–92

    Article  MathSciNet  Google Scholar 

  4. Boyle M, Krieger W (1988) Almost Markov and shift equivalent sofic systems. In: Proceedings of Maryland special year in dynamics 1986–1987. Lecture Notes in Mathematics, vol 1342. Springer, pp 33–93

    Google Scholar 

  5. Bratteli O (1972) Inductive limits of finite-dimensional C ∗-algebras. Trans Am Math Soc 171:195–234

    MATH  MathSciNet  Google Scholar 

  6. Brown LG (1983) The universal coefficient theorem for Ext and quasidiagonality. Operator Algebras and Group Representation, vol 17. Pitmann Press, Boston, pp 60–64

    Google Scholar 

  7. Carlsen TM, Eilers S (2004) Matsumoto K-groups associated to certain shift spaces. Doc Math 9:639–671

    MATH  MathSciNet  Google Scholar 

  8. Carlsen TM, Eilers S (2006) K-groups associated to substitutional dynamics. J Funct Anal 238:99–117

    Article  MATH  MathSciNet  Google Scholar 

  9. Chomsky N, Schützenberger MP (1963) The algebraic theory of context-free languages. In: Braffort P, Hirschberg D (eds) Computer programing and formal systems. North-Holland, Amsterdam, pp 118–161

    Chapter  Google Scholar 

  10. Cuntz J, Krieger W (1980) A class of C ∗-algebras and topological Markov chains. Invent Math 56:251–268

    Article  MATH  MathSciNet  Google Scholar 

  11. Denker M, Grillenberger C, Sigmund K (1976) Ergodic theory on compact spaces. Springer, Berlin, Heidelberg and New York

    MATH  Google Scholar 

  12. Effros EG (1981) Dimensions and C ∗-algebras. In: AMS-CBMS Reg Conf Ser Math, vol 46. American Mathematical Society, Providence, RI

    Google Scholar 

  13. Enomoto M, Fujii M, Watatani Y (1984) KMS states for gauge action on \({\mathcal{O}}_{A}\). Math Japon 29:607–619

    MATH  MathSciNet  Google Scholar 

  14. Fischer R (1975) Sofic systems and graphs. Monats für Math 80:179–186

    Article  MATH  Google Scholar 

  15. Franks J (1984) Flow equivalence of subshifts of finite type. Ergod Theory Dyn Syst 4:53–66

    Article  MATH  MathSciNet  Google Scholar 

  16. Hamachi T, Nasu M (1988) Topological conjugacy for 1-block factor maps of subshifts and sofic covers. In: Proceedings of Maryland special year in dynamics 1986–1987. Lecture Notes in Mathematics, vol 1342. Springer, pp 251–260

    Google Scholar 

  17. Hopcroft JE, Ullman JD (2001) Introduction to automata theory, languages, and computation. Addison-Wesley, Reading, MA

    MATH  Google Scholar 

  18. Katayama Y, Matsumoto K, Watatani Y (1998) Simple C ∗-algebras arising from β-expansion of real numbers. Ergod Theory Dyn Syst 18:937–962

    Article  MATH  MathSciNet  Google Scholar 

  19. Kim KH, Roush FW (1979) Some results on decidability of shift equivalence. J Combin Inf Syst Sci 4:123–146

    MATH  MathSciNet  Google Scholar 

  20. Kim KH, Roush FW (1999) Williams conjecture is false for irreducible subshifts. Ann Math 149:545–558

    Article  MATH  MathSciNet  Google Scholar 

  21. Kitchens BP (1998) Symbolic dynamics. Springer, Berlin

    MATH  Google Scholar 

  22. Krieger W (1974) On the uniqueness of the equilibrium state. Math Syst Theory 8:97–104

    Article  MathSciNet  Google Scholar 

  23. Krieger W (1980) On dimension for a class of homeomorphism groups. Math Ann 252:87–95

    Article  MATH  MathSciNet  Google Scholar 

  24. Krieger W (1980) On dimension functions and topological Markov chains. Invent Math 56:239–250

    Article  MATH  MathSciNet  Google Scholar 

  25. Krieger W (1984) On sofic systems I. Isr J Math 48:305–330

    Article  MATH  MathSciNet  Google Scholar 

  26. Krieger W (1987) On sofic systems II. Isr J Math 60:167–176

    Article  MATH  MathSciNet  Google Scholar 

  27. Krieger W (2000) On subshifts and topological Markov chains. Numbers, Information and Complexity (Bielefeld 1998). Kluwer, Boston, MA, pp 453–472

    Google Scholar 

  28. Krieger W, Matsumoto K (2002) Shannon graphs, subshifts and lambda-graph systems. J Math Soc Jpn 54:877–900

    Article  MATH  MathSciNet  Google Scholar 

  29. Krieger W, Matsumoto K (2003) A lambda-graph system for the Dyck shift and its K-groups. Doc Math 8:79–96

    MATH  MathSciNet  Google Scholar 

  30. Krieger W, Matsumoto K (2004) A class of topological conjugacy of subshifts. Ergod Theory Dyn Syst 24:1155–1172

    Article  MATH  MathSciNet  Google Scholar 

  31. Krieger W, Matsumoto K (2010) Subshifts and C ∗​-algebras from one-counter codes. Contemporary Math AMS (to appear)-10pt]Please update reference [31].

    Google Scholar 

  32. Kumjian A, Pask D, Raeburn I, Renault J (1997) Graphs, groupoids and Cuntz–Krieger algebras. J Funct Anal 144:505–541

    Article  MathSciNet  Google Scholar 

  33. Lind D, Marcus B (1995) An introduction to symbolic dynamics and coding. Cambridge University Press, Cambridge

    Book  MATH  Google Scholar 

  34. Matsumoto K (1999) A simple C ∗-algebra arising from certain subshift. J Oper Theory 42:351–370

    MATH  Google Scholar 

  35. Matsumoto K (1999) Dimension groups for subshifts and simplicity of the associated C ∗-algebras. J Math Soc Jpn 51:679–698

    Article  MATH  Google Scholar 

  36. Matsumoto K (1999) Presentations of subshifts and their topological conjugacy invariants. Doc Math 4:285–340

    MATH  MathSciNet  Google Scholar 

  37. Matsumoto K (2000) Stabilized C ∗-algebras constructed from symbolic dynamical systems. Ergod Theor Dyn Syst 20:821–841

    Article  MATH  Google Scholar 

  38. Matsumoto K (2001) Bowen–Franks groups for subshifts and Ext-groups for C ∗-algebras. K Theor 23:67–104

    Google Scholar 

  39. Matsumoto K (2001) Bowen–Franks groups as an invariant for flow equivalence of subshifts. Ergod Theory Dyn Syst 21:1831–1842

    MATH  Google Scholar 

  40. Matsumoto K (2002) C ∗-algebras associated with presentations of subshifts. Doc Math 7:1–30

    MATH  MathSciNet  Google Scholar 

  41. Matsumoto K (2003) On strong shift equivalence of symbolic matrix systems. Ergod Theory Dyn Syst 23:1551–1574

    Article  MATH  Google Scholar 

  42. Matsumoto K (2005) Topological entropy in C ∗-algebras associated with λ-graph systems. Ergod Theor Dyn Syst 25:1935–1951

    Article  MATH  Google Scholar 

  43. Matsumoto K (2005) K-theoretic invariants and conformal measures on the Dyck shifts. Int J Math 16:213–248

    Article  MATH  Google Scholar 

  44. Matsumoto K (2007) Actions of symbolic dynamical systems on C ∗-algebras. J Reine Angew Math 605:23–49

    MATH  MathSciNet  Google Scholar 

  45. Matsumoto K A class of simple C ∗-algebras arising from certain nonsofic subshifts. Preprint, arxiv:0805.2767

    Google Scholar 

  46. Matsumoto K, Watatani Y, Yoshida M (1998) KMS-states for gauge actions on C ∗-algebras associated with subshifts. Math Z 228:489–509

    Article  MATH  MathSciNet  Google Scholar 

  47. Nasu M (1986) Topological conjugacy for sofic shifts. Ergod Theory Dyn Syst 6:265–280

    Article  MATH  MathSciNet  Google Scholar 

  48. Nasu M (1995) Textile systems for endomorphisms and automorphisms of the shift. Mem Am Math Soc 114:546

    MathSciNet  Google Scholar 

  49. Parry W, Sullivan D (1975) A topological invariant for flows on one-dimensional spaces. Topology 14:297–299

    Article  MATH  MathSciNet  Google Scholar 

  50. Tuncel S (1983) A dimension, dimension modules, and Markov chains. Proc Lond Math Soc 46:100–116

    Article  MATH  MathSciNet  Google Scholar 

  51. Weiss B (1973) Subshifts of finite type and sofic systems. Monatsh Math 77:462–474

    Article  MATH  MathSciNet  Google Scholar 

  52. Williams RF (1973) Classification of subshifts of finite type. Ann Math 98:120–153. Erratum (1974) Ann Math 99:380–381

    Google Scholar 

Download references

Acknowledgements

The author would like to deeply thank Matthias Dehmer and Jun Ichi Fujii for their invitation to the author to write this chapter and for their helpful suggestions in the presentation of this paper.

Author information

Authors and Affiliations

  1. Department of Mathematics, Joetsu University of Education, Joetsu, 943-8512, Japan

    Kengo Matsumoto

Authors
  1. Kengo Matsumoto
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kengo Matsumoto .

Editor information

Editors and Affiliations

  1. Medizinische Informatik und Technik, Institute for Bioinformatics and Transla, UMIT-Private Universität für Gesundheits, Eduard Wallnöfer-Zentrum 1, Hall in Tirol, A-6060, Austria

    Matthias Dehmer

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Matsumoto, K. (2011). Application of Infinite Labeled Graphs to Symbolic Dynamical Systems. In: Dehmer, M. (eds) Structural Analysis of Complex Networks. Birkhäuser Boston. https://doi.org/10.1007/978-0-8176-4789-6_6

Download citation

Publish with us

Policies and ethics

Search

Navigation