Application of Infinite Labeled Graphs to Symbolic Dynamical Systems
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.
KeywordsSubshifts Symbolic dynamics λ-Graph systems Strong shift equivalence Bowen–Franks group K-theory Topological entropy
Unable to display preview. Download preview PDF.
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.
- 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–93Google 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–64Google Scholar
- 12.Effros EG (1981) Dimensions and C ∗-algebras. In: AMS-CBMS Reg Conf Ser Math, vol 46. American Mathematical Society, Providence, RIGoogle 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–260Google Scholar
- 27.Krieger W (2000) On subshifts and topological Markov chains. Numbers, Information and Complexity (Bielefeld 1998). Kluwer, Boston, MA, pp 453–472Google Scholar
- 31.Krieger W, Matsumoto K (2010) Subshifts and C ∗-algebras from one-counter codes. Contemporary Math AMS (to appear)-10pt]Please update reference .Google Scholar
- 38.Matsumoto K (2001) Bowen–Franks groups for subshifts and Ext-groups for C ∗-algebras. K Theor 23:67–104Google Scholar
- 45.Matsumoto K A class of simple C ∗-algebras arising from certain nonsofic subshifts. Preprint, arxiv:0805.2767Google Scholar
- 52.Williams RF (1973) Classification of subshifts of finite type. Ann Math 98:120–153. Erratum (1974) Ann Math 99:380–381Google Scholar